Struct floresta_chain::pruned_utreexo::consensus::Consensus

pub struct Consensus {
    pub parameters: ChainParams,
}

This struct contains all the information and methods needed to validate a block, it is used by the [ChainState] to validate blocks and transactions.

Fields

parameters: ChainParams

The parameters of the chain we are validating, it is usually hardcoded constants. See ChainParams for more information.

Implementations

impl Consensus

pub fn get_subsidy(&self, height: u32) -> u64

Returns the amount of block subsidy to be paid in a block, given it’s height. Bitcoin Core source: https://github.com/bitcoin/bitcoin/blob/2b211b41e36f914b8d0487e698b619039cc3c8e2/src/validation.cpp#L1501-L1512

pub fn verify_block_transactions( height: u32, utxos: HashMap<OutPoint, TxOut>, transactions: &[Transaction], subsidy: u64, verify_script: bool, flags: c_uint ) -> Result<(), BlockchainError>

Verify if all transactions in a block are valid. Here we check the following:

• The block must contain at least one transaction, and this transaction must be coinbase
• The first transaction in the block must be coinbase
• The coinbase transaction must have the correct value (subsidy + fees)
• The block must not create more coins than allowed
• All transactions must be valid:
  • The transaction must not be coinbase (already checked)
  • The transaction must not have duplicate inputs
  • The transaction must not spend more coins than it claims in the inputs
  • The transaction must have valid scripts

pub fn calc_next_work_required( last_block: &BlockHeader, first_block: &BlockHeader, params: ChainParams ) -> Target

Calculates the next target for the proof of work algorithm, given the current target and the time it took to mine the last 2016 blocks.

pub fn update_acc( acc: &Stump, block: &Block, height: u32, proof: Proof, del_hashes: Vec<Hash> ) -> Result<Stump, BlockchainError>

Updates our accumulator with the new block. This is done by calculating the new root hash of the accumulator, and then verifying the proof of inclusion of the deleted nodes. If the proof is valid, we return the new accumulator. Otherwise, we return an error. This function is pure, it doesn’t modify the accumulator, but returns a new one.

Trait Implementations

impl Clone for Consensus

fn clone(&self) -> Consensus

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Consensus

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

Formats the value using the given formatter.