mod.rs

use std::{
    cell::{Cell, RefCell},
    cmp::Ordering,
    collections::{BTreeMap, BTreeSet, HashMap, HashSet},
    convert::{TryFrom, TryInto},
    fmt,
    fmt::Write as _,
    ops::{AddAssign, SubAssign},
    str::FromStr,
};

use bech32::{FromBase32, ToBase32};
use bls_signatures_rs::{bn256, bn256::Bn256, MultiSignature};
use ethereum_types::U256;
use failure::Fail;
use futures::future::BoxFuture;
use ordered_float::OrderedFloat;
use serde::{Deserialize, Serialize};

use partial_struct::PartialStruct;
use witnet_crypto::{
    hash::{calculate_sha256, Sha256},
    key::ExtendedSK,
    merkle::merkle_tree_root as crypto_merkle_tree_root,
    secp256k1::{
        self,
        ecdsa::{RecoverableSignature, RecoveryId, Signature as Secp256k1_Signature},
        Message, PublicKey as Secp256k1_PublicKey, SecretKey as Secp256k1_SecretKey,
    },
};
use witnet_protected::Protected;
use witnet_reputation::{ActiveReputationSet, TotalReputationSet};

use crate::{
    chain::{
        tapi::{ActiveWips, TapiEngine},
        Signature::Secp256k1,
    },
    data_request::{calculate_reward_collateral_ratio, DataRequestPool},
    error::{
        DataRequestError, EpochCalculationError, OutputPointerParseError, Secp256k1ConversionError,
        TransactionError,
    },
    get_environment, get_protocol_version, get_protocol_version_activation_epoch,
    proto::{
        versioning::{ProtocolInfo, ProtocolVersion, Versioned, VersionedHashable},
        ProtobufConvert,
    },
    staking::prelude::*,
    superblock::SuperBlockState,
    transaction::{
        CommitTransaction, DRTransaction, DRTransactionBody, Memoized, MintTransaction,
        RevealTransaction, StakeTransaction, TallyTransaction, Transaction, TxInclusionProof,
        UnstakeTransaction, VTTransaction,
    },
    transaction::{
        MemoHash, MemoizedHashable, BETA, COMMIT_WEIGHT, OUTPUT_SIZE, REVEAL_WEIGHT, TALLY_WEIGHT,
    },
    utxo_pool::{OldUnspentOutputsPool, OwnUnspentOutputsPool, UnspentOutputsPool},
    vrf::{BlockEligibilityClaim, DataRequestEligibilityClaim},
    wit::{Wit, WIT_DECIMAL_PLACES},
};

/// Keeps track of priority being used by transactions included in recent blocks, and provides
/// methods for estimating sensible priority values for future transactions.
pub mod priority;
/// Contains all TAPI related structures and business logic
pub mod tapi;

/// Define how the different structures should be hashed.
pub trait Hashable {
    /// Calculate the hash of `self`
    fn hash(&self) -> Hash;
}

/// Data structure holding critical information about the chain state and protocol constants
#[derive(Debug, Serialize, Deserialize, PartialEq, Clone, Default)]
pub struct ChainInfo {
    /// Keeps track of protocol versions and their related data (e.g. activation epoch)
    pub protocol: ProtocolInfo,

    /// Blockchain valid environment
    pub environment: Environment,

    /// Blockchain Protocol constants
    pub consensus_constants: ConsensusConstants,

    /// Checkpoint of the last block in the blockchain
    pub highest_block_checkpoint: CheckpointBeacon,

    /// Checkpoint hash of the highest superblock in the blockchain
    pub highest_superblock_checkpoint: CheckpointBeacon,

    /// Checkpoint and VRF hash of the highest block in the blockchain
    pub highest_vrf_output: CheckpointVRF,
}

/// State machine for the synchronization status of a Witnet node
#[derive(Copy, Clone, Default, Deserialize, Debug, Eq, PartialEq, Serialize)]
pub enum StateMachine {
    /// First state, ChainManager is waiting for reaching  consensus between its peers
    #[default]
    WaitingConsensus,
    /// Second state, ChainManager synchronization process
    Synchronizing,
    /// Third state, `ChainManager` has all the blocks in the chain and is ready to start
    /// consolidating block candidates in real time.
    AlmostSynced,
    /// Fourth state, `ChainManager` can consolidate block candidates, propose its own
    /// candidates (mining) and participate in resolving data requests (witnessing).
    Synced,
}

/// Node synchronization status
#[derive(Debug, Default, Deserialize, Serialize)]
pub struct SyncStatus {
    /// The hash of the top consolidated block and the epoch of that block
    pub chain_beacon: CheckpointBeacon,
    /// The current epoch, or None if the epoch 0 is in the future
    pub current_epoch: Option<u32>,
    /// Node State
    pub node_state: StateMachine,
}

/// Possible values for the "environment" configuration param.
// The variants are explicitly tagged so that bincode serialization does not break
#[derive(Serialize, Deserialize, Copy, Clone, Debug, Default, PartialEq, Eq)]
pub enum Environment {
    /// "mainnet" environment
    #[default]
    #[serde(rename = "mainnet")]
    Mainnet = 0,
    /// "testnet" environment
    #[serde(rename = "testnet")]
    Testnet = 1,
    /// "development" environment
    #[serde(rename = "development")]
    Development = 2,
}

impl fmt::Display for Environment {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        let s = match self {
            Environment::Development => "development",
            Environment::Mainnet => "mainnet",
            Environment::Testnet => "testnet",
        };

        f.write_str(s)
    }
}

impl Environment {
    /// Returns the Bech32 prefix used in this environment: "wit" in mainnet and "twit" elsewhere
    pub fn bech32_prefix(&self) -> &str {
        match self {
            Environment::Mainnet => "wit",
            _ => "twit",
        }
    }

    /// Returns true if the consensus constants can be overriden in this environment.
    /// This is only allowed in a development environment.
    pub fn can_override_consensus_constants(self) -> bool {
        matches!(self, Environment::Development)
    }
}

/// Consensus-critical configuration
#[derive(
    PartialStruct, Debug, Clone, PartialEq, Serialize, Deserialize, ProtobufConvert, Default,
)]
#[partial_struct(derive(Deserialize, Serialize, Default, Debug, Clone, PartialEq))]
#[protobuf_convert(pb = "crate::proto::schema::witnet::ConsensusConstants")]
pub struct ConsensusConstants {
    /// Timestamp at checkpoint 0 (the start of epoch 0)
    pub checkpoint_zero_timestamp: i64,

    /// Seconds between the start of an epoch and the start of the next one
    pub checkpoints_period: u16,

    /// Auxiliary bootstrap block hash value
    pub bootstrap_hash: Hash,

    /// Genesis block hash value
    pub genesis_hash: Hash,

    /// Maximum weight a block can have, this affects the number of
    /// transactions a block can contain: there will be as many
    /// transactions as the sum of _their_ weights is less than, or
    /// equal to, this maximum block weight parameter.
    ///
    /// Maximum aggregated weight of all the value transfer transactions in one block
    pub max_vt_weight: u32,
    /// Maximum aggregated weight of all the data requests transactions in one block
    pub max_dr_weight: u32,

    /// An identity is considered active if it participated in the witnessing protocol at least once in the last `activity_period` epochs
    pub activity_period: u32,

    /// Reputation will expire after N witnessing acts
    pub reputation_expire_alpha_diff: u32,

    /// Reputation issuance
    pub reputation_issuance: u32,

    /// When to stop issuing new reputation
    pub reputation_issuance_stop: u32,

    /// Penalization factor: fraction of reputation lost by liars for out of consensus claims
    // FIXME(#172): Use fixed point arithmetic
    pub reputation_penalization_factor: f64,

    /// Backup factor for mining: valid VRFs under this factor will result in broadcasting a block
    pub mining_backup_factor: u32,

    /// Replication factor for mining: valid VRFs under this factor will have priority
    pub mining_replication_factor: u32,

    /// Minimum value in nanowits for a collateral value
    pub collateral_minimum: u64,

    /// Minimum input age of an UTXO for being a valid collateral
    pub collateral_age: u32,

    /// Build a superblock every `superblock_period` epochs
    pub superblock_period: u16,

    /// Extra rounds for commitments and reveals
    pub extra_rounds: u16,

    /// Minimum difficulty
    pub minimum_difficulty: u32,

    /// Number of epochs with the minimum difficulty active
    /// (This number represent the last epoch where the minimum difficulty is active)
    pub epochs_with_minimum_difficulty: u32,

    /// Superblock signing committee for the first superblocks
    pub bootstrapping_committee: Vec<String>,

    /// Size of the superblock signing committee
    pub superblock_signing_committee_size: u32,

    /// Period after which the committee size should decrease (in superblock periods)
    pub superblock_committee_decreasing_period: u32,

    /// Step by which the committee should be reduced after superblock_agreement_decreasing_period
    pub superblock_committee_decreasing_step: u32,

    /// Initial block reward
    pub initial_block_reward: u64,

    /// Halving period
    pub halving_period: u32,
}

impl ConsensusConstants {
    /// Return the "magic number" for this consensus constants.
    /// The magic number is the first 16 bits of the hash of the consensus constants serialized
    /// using `ProtocolBuffers`.
    /// This magic number is used in the handshake protocol to prevent nodes with different
    /// consensus constants from peering with each other.
    pub fn get_magic(&self) -> u16 {
        let magic = calculate_sha256(&self.to_pb_bytes().unwrap());
        u16::from(magic.0[0]) << 8 | (u16::from(magic.0[1]))
    }
}

#[derive(Debug, Clone, Copy, PartialEq, Serialize, Deserialize, ProtobufConvert, Default)]
#[protobuf_convert(pb = "crate::proto::schema::witnet::ConsensusConstantsWit2")]
pub struct ConsensusConstantsWit2 {
    /// Timestamp at checkpoint 0 (the start of epoch 0)
    pub checkpoint_zero_timestamp: i64,

    /// Seconds between the start of an epoch and the start of the next one
    pub checkpoints_period: u16,
}

impl ConsensusConstantsWit2 {
    /// Timestamp when wit/2 activates
    pub fn get_checkpoint_zero_timestamp_wit2(self) -> i64 {
        self.checkpoint_zero_timestamp
            + i64::from(self.checkpoints_period)
                * i64::from(get_protocol_version_activation_epoch(ProtocolVersion::V2_0))
    }

    /// Seconds between the start of an epoch and the start of the next one in wit/2
    pub fn get_checkpoints_period_wit2(self) -> u16 {
        20
    }

    /// Minimum amount of nanoWits which need to be staked before wit/2 activation
    pub fn get_wit2_minimum_total_stake_nanowits(self) -> u64 {
        match get_environment() {
            Environment::Development | Environment::Testnet => 30_000_000_000_000_000,
            _ => 300_000_000_000_000_000,
        }
    }

    /// Number of epochs before wit/2 activates after enough Wit have been staked
    pub fn get_wit2_activation_delay_epochs(self) -> u32 {
        match get_environment() {
            Environment::Development | Environment::Testnet => {
                80 + 21 // One hour + one superepoch for final confirmation
            }
            _ => {
                13_440 + 21 // 1 week + one superepoch for final confirmation
            }
        }
    }

    /// Replication factor for data request solving
    pub fn get_replication_factor(self, epoch: Epoch, prev_epoch: Epoch) -> u16 {
        if get_protocol_version(Some(epoch)) >= ProtocolVersion::V2_0 {
            // linearly increasing replication factor
            if epoch >= prev_epoch {
                4u16.saturating_mul(2u16.saturating_pow(epoch - prev_epoch))
            } else {
                0
            }
        } else {
            0
        }
    }

    /// Maximum weight units that a block can devote to `StakeTransaction`s.
    pub fn get_maximum_stake_block_weight(self, epoch: Epoch) -> u32 {
        if get_protocol_version(Some(epoch)) > ProtocolVersion::V1_7 {
            10_000_000
        } else {
            0
        }
    }

    /// Maximum weight units that a block can devote to `UnstakeTransaction`s.
    pub fn get_maximum_unstake_block_weight(self, epoch: Epoch) -> u32 {
        if get_protocol_version(Some(epoch)) >= ProtocolVersion::V2_0 {
            5_000
        } else {
            0
        }
    }

    /// Unstake transactions are only spendable after below specified time lock expires
    pub fn get_unstaking_delay_seconds(self, epoch: Epoch) -> u64 {
        if get_protocol_version(Some(epoch)) >= ProtocolVersion::V2_0 {
            match get_environment() {
                Environment::Development | Environment::Testnet => {
                    3_600 // 1 hour
                }
                _ => {
                    1_209_600 // 2 weeks
                }
            }
        } else {
            0
        }
    }

    /// Minimum amount of nanoWits that a `StakeTransaction` can add, and minimum amount that can be
    /// left in stake by an `UnstakeTransaction`.
    pub fn get_validator_min_stake_nanowits(self, epoch: Epoch) -> u64 {
        if get_protocol_version(Some(epoch)) > ProtocolVersion::V1_7 {
            10_000_000_000_000 // 10,000 Wit
        } else {
            0
        }
    }

    /// Maximum amount of nanoWits that a `StakeTransaction` can add (and can be staked on a single validator).
    pub fn get_validator_max_stake_nanowits(self, epoch: Epoch) -> u64 {
        if get_protocol_version(Some(epoch)) > ProtocolVersion::V1_7 {
            10_000_000_000_000_000
        } else {
            0
        }
    }

    /// Validator reward for a proposed and accepted block
    pub fn get_validator_block_reward(self, epoch: Epoch) -> u64 {
        if get_protocol_version(Some(epoch)) >= ProtocolVersion::V2_0 {
            50_000_000_000
        } else {
            0
        }
    }

    /// Get the minimum age of a UTXO before it can be used for collateral (during V1.7 and V1.8)
    pub fn get_collateral_age(self, active_wips: &ActiveWips) -> u32 {
        if get_environment() == Environment::Mainnet {
            if active_wips.wip0027() {
                13440 // 1 week
            } else {
                1000 // ~ 12 hours, default from mainnet genesis
            }
        } else {
            80 // 1 hour
        }
    }
}

#[derive(Debug, Fail)]
/// The various reasons creating a genesis block can fail
pub enum GenesisBlockInfoError {
    /// Failed to read file
    #[fail(display = "Failed to read file `{}`: {}", path, inner)]
    Read {
        /// Path of the `genesis_block.json` file
        path: String,
        /// Inner io error
        inner: std::io::Error,
    },
    /// Failed to deserialize
    #[fail(display = "Failed to deserialize `GenesisBlockInfo`: {}", _0)]
    Deserialize(serde_json::Error),
    /// The hash of the created genesis block does not match the hash set in the configuration
    #[fail(
        display = "Genesis block hash mismatch\nExpected: {}\nFound:    {}",
        expected, created
    )]
    HashMismatch {
        /// Hash of the genesis block as created by reading the `genesis_block.json` file
        created: Hash,
        /// Hash of the genesis block specified in the configuration
        expected: Hash,
    },
}

/// Information needed to create the genesis block.
///
/// To prevent deserialization issues, the JSON file only contains string types: all integers
/// must be surrounded by quotes.
///
/// This is the format of `genesis_block.json`:
///
/// ```ignore
/// {
///     "alloc":[
///         [
///             {
///                 "address": "twit1adgt8t2h3xnu358f76zxlph0urf2ev7cd78ggc",
///                 "value": "500000000000",
///                 "timelock": "0"
///             },
///         ]
///     ]
/// }
/// ```
///
/// The `alloc` field has two levels of arrays: the outer array is the list of transactions,
/// and the inner arrays are lists of `ValueTransferOutput` inside that transaction.
///
/// Note that in order to be valid:
/// * All transactions must have at least one output (but there can be 0 transactions)
/// * All the outputs must have some value (value cannot be 0)
/// * The sum of the value of all the outputs and the total block reward must be below 2^64
#[derive(Clone, Debug, Deserialize)]
#[serde(from = "crate::serialization_helpers::GenesisBlock")]
pub struct GenesisBlockInfo {
    /// The outer array is the list of transactions
    /// and the inner arrays are lists of `ValueTransferOutput` inside that transaction.
    pub alloc: Vec<Vec<ValueTransferOutput>>,
}

impl GenesisBlockInfo {
    /// Create a genesis block with the transactions from `self.alloc`.
    pub fn build_genesis_block(self, bootstrap_hash: Hash) -> Block {
        Block::genesis(
            bootstrap_hash,
            self.alloc.into_iter().map(VTTransaction::genesis).collect(),
        )
    }

    /// Read `GenesisBlockInfo` from `genesis_block.json` file
    pub fn from_path(
        path: &str,
        bootstrap_hash: Hash,
        genesis_block_hash: Hash,
    ) -> Result<Self, GenesisBlockInfoError> {
        let response = std::fs::read_to_string(path).map_err(|e| GenesisBlockInfoError::Read {
            path: path.to_string(),
            inner: e,
        })?;

        let genesis_block: GenesisBlockInfo =
            serde_json::from_str(&response).map_err(GenesisBlockInfoError::Deserialize)?;

        // TODO: the genesis block should only be created once
        let built_genesis_block_hash = genesis_block
            .clone()
            .build_genesis_block(bootstrap_hash)
            .versioned_hash(get_protocol_version(Some(0)));

        if built_genesis_block_hash != genesis_block_hash {
            Err(GenesisBlockInfoError::HashMismatch {
                created: built_genesis_block_hash,
                expected: genesis_block_hash,
            })
        } else {
            Ok(genesis_block)
        }
    }
}

/// Checkpoint beacon structure
#[derive(
    Copy, Clone, Debug, Default, Eq, Hash, PartialEq, Serialize, Deserialize, ProtobufConvert,
)]
#[protobuf_convert(pb = "crate::proto::schema::witnet::CheckpointBeacon")]
#[serde(rename_all = "camelCase")]
pub struct CheckpointBeacon {
    /// The serial number for an epoch
    pub checkpoint: Epoch,
    /// The 256-bit hash of the previous block header
    pub hash_prev_block: Hash,
}

/// Checkpoint VRF structure
#[derive(
    Copy, Clone, Debug, Default, Eq, Hash, PartialEq, Serialize, Deserialize, ProtobufConvert,
)]
#[protobuf_convert(pb = "crate::proto::schema::witnet::CheckpointVRF")]
#[serde(rename_all = "camelCase")]
pub struct CheckpointVRF {
    /// The serial number for an epoch
    pub checkpoint: Epoch,
    /// The 256-bit hash of the VRF used in the previous block
    pub hash_prev_vrf: Hash,
}

/// Epoch id (starting from 0)
pub type Epoch = u32;

/// Block data structure
#[derive(Debug, Eq, PartialEq, Clone, Serialize, Deserialize, ProtobufConvert, Default, Hash)]
#[protobuf_convert(pb = "crate::proto::schema::witnet::Block")]
pub struct Block {
    /// The header of the block
    pub block_header: BlockHeader,
    /// A miner-provided signature of the block header, for the sake of integrity
    pub block_sig: KeyedSignature,
    /// A non-empty list of signed transactions
    pub txns: BlockTransactions,

    #[protobuf_convert(skip)]
    #[serde(skip)]
    hash: MemoHash,
}

/// Block transactions
#[derive(Debug, Default, Eq, PartialEq, Clone, Serialize, Deserialize, ProtobufConvert, Hash)]
#[protobuf_convert(pb = "crate::proto::schema::witnet::Block_BlockTransactions")]
pub struct BlockTransactions {
    /// Mint transaction,
    pub mint: MintTransaction,
    /// A list of signed value transfer transactions
    pub value_transfer_txns: Vec<VTTransaction>,
    /// A list of signed data request transactions
    pub data_request_txns: Vec<DRTransaction>,
    /// A list of signed commit transactions
    pub commit_txns: Vec<CommitTransaction>,
    /// A list of signed reveal transactions
    pub reveal_txns: Vec<RevealTransaction>,
    /// A list of signed tally transactions
    pub tally_txns: Vec<TallyTransaction>,
    /// A list of signed stake transactions
    #[serde(default)]
    pub stake_txns: Vec<StakeTransaction>,
    /// A list of signed unstake transactions
    #[serde(default)]
    pub unstake_txns: Vec<UnstakeTransaction>,
}

impl Block {
    /// Simple factory for the `Block` data structure that automatically initiates the hash field
    /// without actually performing the hash operation, just in case it is never used.
    pub fn new(
        block_header: BlockHeader,
        block_sig: KeyedSignature,
        txns: BlockTransactions,
    ) -> Self {
        Self {
            block_header,
            block_sig,
            txns,
            hash: Default::default(),
        }
    }

    /// Construct the genesis block.
    /// This is a special block that is only valid for checkpoint 0, because it creates value.
    pub fn genesis(bootstrap_hash: Hash, value_transfer_txns: Vec<VTTransaction>) -> Block {
        let txns = BlockTransactions {
            mint: MintTransaction::default(),
            value_transfer_txns,
            data_request_txns: vec![],
            commit_txns: vec![],
            reveal_txns: vec![],
            tally_txns: vec![],
            stake_txns: vec![],
            unstake_txns: vec![],
        };

        /// Function to calculate a merkle tree from a transaction vector
        pub fn merkle_tree_root<T>(transactions: &[T]) -> Hash
        where
            T: Hashable,
        {
            let transactions_hashes: Vec<Sha256> = transactions
                .iter()
                .map(|x| match x.hash() {
                    Hash::SHA256(x) => Sha256(x),
                })
                .collect();

            Hash::from(crypto_merkle_tree_root(&transactions_hashes))
        }

        let merkle_roots = BlockMerkleRoots {
            mint_hash: txns.mint.hash(),
            vt_hash_merkle_root: merkle_tree_root(&txns.value_transfer_txns),
            dr_hash_merkle_root: merkle_tree_root(&txns.data_request_txns),
            commit_hash_merkle_root: merkle_tree_root(&txns.commit_txns),
            reveal_hash_merkle_root: merkle_tree_root(&txns.reveal_txns),
            tally_hash_merkle_root: merkle_tree_root(&txns.tally_txns),
            stake_hash_merkle_root: Hash::default(),
            unstake_hash_merkle_root: Hash::default(),
        };

        Block::new(
            BlockHeader {
                signals: 1,
                beacon: CheckpointBeacon {
                    checkpoint: 0,
                    hash_prev_block: bootstrap_hash,
                },
                merkle_roots,
                proof: Default::default(),
                bn256_public_key: Default::default(),
            },
            Default::default(),
            txns,
        )
    }

    pub fn dr_weight(&self) -> u32 {
        let mut dr_weight = 0;
        for dr_txn in self.txns.data_request_txns.iter() {
            dr_weight += dr_txn.weight();
        }
        dr_weight
    }

    pub fn vt_weight(&self) -> u32 {
        let mut vt_weight = 0;
        for vt_txn in self.txns.value_transfer_txns.iter() {
            vt_weight += vt_txn.weight();
        }
        vt_weight
    }

    pub fn st_weight(&self) -> u32 {
        let mut st_weight = 0;
        for st_txn in self.txns.stake_txns.iter() {
            st_weight += st_txn.weight();
        }
        st_weight
    }

    pub fn ut_weight(&self) -> u32 {
        let mut ut_weight = 0;
        for ut_txn in self.txns.unstake_txns.iter() {
            ut_weight += ut_txn.weight();
        }
        ut_weight
    }

    pub fn weight(&self) -> u32 {
        self.dr_weight() + self.vt_weight() + self.st_weight() + self.ut_weight()
    }

    pub fn is_genesis(&self, genesis: &Hash) -> bool {
        self.hash().eq(genesis)
    }
}

impl BlockTransactions {
    /// Return the number of transactions inside this block. This value includes the mint
    /// transaction, as well as all the data requests, commits, reveals and tallies.
    pub fn len(&self) -> usize {
        self.mint.len()
            + self.value_transfer_txns.len()
            + self.data_request_txns.len()
            + self.commit_txns.len()
            + self.reveal_txns.len()
            + self.tally_txns.len()
            + self.stake_txns.len()
            + self.unstake_txns.len()
    }

    /// Returns true if this block contains no transactions
    // TODO: this is impossible, remove this method
    pub fn is_empty(&self) -> bool {
        self.mint.is_empty()
            && self.value_transfer_txns.is_empty()
            && self.data_request_txns.is_empty()
            && self.commit_txns.is_empty()
            && self.reveal_txns.is_empty()
            && self.tally_txns.is_empty()
            && self.stake_txns.is_empty()
            && self.unstake_txns.is_empty()
    }

    /// Get a transaction given the `TransactionPointer`
    pub fn get(&self, index: TransactionPointer) -> Option<Transaction> {
        match index {
            TransactionPointer::Mint => Some(&self.mint).cloned().map(Transaction::Mint),
            TransactionPointer::ValueTransfer(i) => self
                .value_transfer_txns
                .get(i as usize)
                .cloned()
                .map(Transaction::ValueTransfer),
            TransactionPointer::DataRequest(i) => self
                .data_request_txns
                .get(i as usize)
                .cloned()
                .map(Transaction::DataRequest),
            TransactionPointer::Commit(i) => self
                .commit_txns
                .get(i as usize)
                .cloned()
                .map(Transaction::Commit),
            TransactionPointer::Reveal(i) => self
                .reveal_txns
                .get(i as usize)
                .cloned()
                .map(Transaction::Reveal),
            TransactionPointer::Tally(i) => self
                .tally_txns
                .get(i as usize)
                .cloned()
                .map(Transaction::Tally),
            TransactionPointer::Stake(i) => self
                .stake_txns
                .get(i as usize)
                .cloned()
                .map(Transaction::Stake),
            TransactionPointer::Unstake(i) => self
                .unstake_txns
                .get(i as usize)
                .cloned()
                .map(Transaction::Unstake),
        }
    }

    /// Create a list of `(transaction_hash, pointer_to_block)` for all the transactions inside
    /// this block
    pub fn create_pointers_to_transactions(&self, block_hash: Hash) -> Vec<(Hash, PointerToBlock)> {
        // Store all the transactions as well
        let mut pointer_to_block = PointerToBlock {
            block_hash,
            transaction_index: TransactionPointer::Mint,
        };
        let mut items_to_add = Vec::with_capacity(self.len());
        // Push mint transaction
        {
            let tx_hash = self.mint.hash();
            items_to_add.push((tx_hash, pointer_to_block.clone()));
        }
        for (i, tx) in self.value_transfer_txns.iter().enumerate() {
            pointer_to_block.transaction_index =
                TransactionPointer::ValueTransfer(u32::try_from(i).unwrap());
            items_to_add.push((tx.hash(), pointer_to_block.clone()));
        }
        for (i, tx) in self.data_request_txns.iter().enumerate() {
            pointer_to_block.transaction_index =
                TransactionPointer::DataRequest(u32::try_from(i).unwrap());
            items_to_add.push((tx.hash(), pointer_to_block.clone()));
        }
        for (i, tx) in self.commit_txns.iter().enumerate() {
            pointer_to_block.transaction_index =
                TransactionPointer::Commit(u32::try_from(i).unwrap());
            items_to_add.push((tx.hash(), pointer_to_block.clone()));
        }
        for (i, tx) in self.reveal_txns.iter().enumerate() {
            pointer_to_block.transaction_index =
                TransactionPointer::Reveal(u32::try_from(i).unwrap());
            items_to_add.push((tx.hash(), pointer_to_block.clone()));
        }
        for (i, tx) in self.tally_txns.iter().enumerate() {
            pointer_to_block.transaction_index =
                TransactionPointer::Tally(u32::try_from(i).unwrap());
            items_to_add.push((tx.hash(), pointer_to_block.clone()));
        }
        for (i, tx) in self.stake_txns.iter().enumerate() {
            pointer_to_block.transaction_index =
                TransactionPointer::Stake(u32::try_from(i).unwrap());
            items_to_add.push((tx.hash(), pointer_to_block.clone()));
        }
        for (i, tx) in self.unstake_txns.iter().enumerate() {
            pointer_to_block.transaction_index =
                TransactionPointer::Unstake(u32::try_from(i).unwrap());
            items_to_add.push((tx.hash(), pointer_to_block.clone()));
        }

        items_to_add
    }
}

impl Hashable for BlockHeader {
    fn hash(&self) -> Hash {
        calculate_sha256(&self.to_pb_bytes().unwrap()).into()
    }
}

impl MemoizedHashable for Block {
    fn hashable_bytes(&self) -> Vec<u8> {
        self.block_header
            .to_versioned_pb_bytes(ProtocolVersion::guess())
            .unwrap()
    }

    fn memoized_hash(&self) -> &MemoHash {
        &self.hash
    }
}

impl Hashable for CheckpointBeacon {
    fn hash(&self) -> Hash {
        calculate_sha256(&self.to_pb_bytes().unwrap()).into()
    }
}

impl Hashable for CheckpointVRF {
    fn hash(&self) -> Hash {
        calculate_sha256(&self.to_pb_bytes().unwrap()).into()
    }
}

impl Hashable for DataRequestOutput {
    fn hash(&self) -> Hash {
        calculate_sha256(&self.to_pb_bytes().unwrap()).into()
    }
}

impl Hashable for PublicKey {
    fn hash(&self) -> Hash {
        let mut v = vec![];
        v.extend([self.compressed]);
        v.extend(self.bytes);

        calculate_sha256(&v).into()
    }
}

/// Block header structure
#[derive(Debug, Eq, PartialEq, Clone, Serialize, Deserialize, ProtobufConvert, Default, Hash)]
#[protobuf_convert(pb = "crate::proto::schema::witnet::Block_BlockHeader")]
pub struct BlockHeader {
    /// 32 bits for binary signaling new witnet protocol improvements.
    /// See [WIP-0014](https://github.com/witnet/WIPs/blob/master/wip-0014.md) for more info.
    pub signals: u32,
    /// A checkpoint beacon for the epoch that this block is closing
    pub beacon: CheckpointBeacon,
    /// 256-bit hashes of all of the transactions committed to this block, so as to prove their belonging and integrity
    pub merkle_roots: BlockMerkleRoots,
    /// A miner-provided proof of leadership
    pub proof: BlockEligibilityClaim,
    /// The Bn256 public key
    pub bn256_public_key: Option<Bn256PublicKey>,
}
/// Block merkle tree roots
#[derive(Debug, Eq, PartialEq, Clone, Serialize, Deserialize, ProtobufConvert, Default, Hash)]
#[protobuf_convert(pb = "crate::proto::schema::witnet::Block_BlockHeader_BlockMerkleRoots")]
pub struct BlockMerkleRoots {
    /// A 256-bit hash based on the mint transaction committed to this block
    pub mint_hash: Hash,
    /// A 256-bit hash based on all the value transfer transactions committed to this block
    pub vt_hash_merkle_root: Hash,
    /// A 256-bit hash based on all the data request transactions committed to this block
    pub dr_hash_merkle_root: Hash,
    /// A 256-bit hash based on all the commit transactions committed to this block
    pub commit_hash_merkle_root: Hash,
    /// A 256-bit hash based on all the reveal transactions committed to this block
    pub reveal_hash_merkle_root: Hash,
    /// A 256-bit hash based on all the tally transactions committed to this block
    pub tally_hash_merkle_root: Hash,
    /// A 256-bit hash based on all the stake transactions committed to this block
    #[serde(default)]
    pub stake_hash_merkle_root: Hash,
    /// A 256-bit hash based on all the unstake transactions committed to this block
    #[serde(default)]
    pub unstake_hash_merkle_root: Hash,
}

/// Function to calculate a merkle tree from a transaction vector
pub fn merkle_tree_root<T>(transactions: &[T], protocol_version: ProtocolVersion) -> Hash
where
    T: VersionedHashable,
{
    let transactions_hashes: Vec<Sha256> = transactions
        .iter()
        .map(|x| match x.versioned_hash(protocol_version) {
            Hash::SHA256(x) => Sha256(x),
        })
        .collect();

    Hash::from(witnet_crypto::merkle::merkle_tree_root(
        &transactions_hashes,
    ))
}

impl BlockMerkleRoots {
    pub fn from_transactions(txns: &BlockTransactions, protocol_version: ProtocolVersion) -> Self {
        BlockMerkleRoots {
            mint_hash: txns.mint.versioned_hash(protocol_version),
            vt_hash_merkle_root: merkle_tree_root(&txns.value_transfer_txns, protocol_version),
            dr_hash_merkle_root: merkle_tree_root(&txns.data_request_txns, protocol_version),
            commit_hash_merkle_root: merkle_tree_root(&txns.commit_txns, protocol_version),
            reveal_hash_merkle_root: merkle_tree_root(&txns.reveal_txns, protocol_version),
            tally_hash_merkle_root: merkle_tree_root(&txns.tally_txns, protocol_version),
            stake_hash_merkle_root: {
                if protocol_version < ProtocolVersion::V1_8 {
                    Hash::default()
                } else {
                    merkle_tree_root(&txns.stake_txns, protocol_version)
                }
            },
            unstake_hash_merkle_root: {
                if protocol_version < ProtocolVersion::V2_0 {
                    Hash::default()
                } else {
                    merkle_tree_root(&txns.unstake_txns, protocol_version)
                }
            },
        }
    }
}

/// `SuperBlock` abridges the tally and data request information that happened during a
/// `superblock_period` number of Witnet epochs as well the ARS members merkle root
/// as of the last block in that period.
/// This is needed to ensure that the security and trustlessness properties of Witnet will
/// be relayed to bridges with other block chains.
#[derive(Clone, Debug, Default, Deserialize, Eq, PartialEq, ProtobufConvert, Serialize)]
#[protobuf_convert(pb = "crate::proto::schema::witnet::SuperBlock")]
pub struct SuperBlock {
    /// Number of signing committee members,
    pub signing_committee_length: u32,
    /// Merkle root of the Active Reputation Set members included into the previous SuperBlock
    pub ars_root: Hash,
    /// Merkle root of the data requests in the blocks created since the last SuperBlock
    pub data_request_root: Hash,
    /// Superblock index,
    pub index: u32,
    /// Hash of the block that this SuperBlock is attesting as the latest block in the block chain,
    pub last_block: Hash,
    /// Hash of the block that the previous SuperBlock used for its own `last_block` field,
    pub last_block_in_previous_superblock: Hash,
    /// Merkle root of the tallies in the blocks created since the last SuperBlock
    pub tally_root: Hash,

    #[protobuf_convert(skip)]
    #[serde(skip)]
    hash: MemoHash,
}

impl MemoizedHashable for SuperBlock {
    fn hashable_bytes(&self) -> Vec<u8> {
        self.serialize_as_bytes()
    }

    fn memoized_hash(&self) -> &MemoHash {
        &self.hash
    }
}

impl SuperBlock {
    /// Simple factory for the `SuperBlock` data structure that automatically initiates the hash
    /// field without actually performing the hash operation, just in case it is never used.
    pub fn new(
        signing_committee_length: u32,
        ars_root: Hash,
        data_request_root: Hash,
        index: u32,
        last_block: Hash,
        last_block_in_previous_superblock: Hash,
        tally_root: Hash,
    ) -> Self {
        Self {
            signing_committee_length,
            ars_root,
            data_request_root,
            index,
            last_block,
            last_block_in_previous_superblock,
            tally_root,
            hash: Default::default(),
        }
    }

    /// Serialize the SuperBlock structure
    /// We do not use protocolBuffers as we would need a protocol buffer decoder in Ethereum
    /// Note that both the node and Ethereum smart contracts need to hash identical superblocks
    fn serialize_as_bytes(&self) -> Vec<u8> {
        [
            &self.signing_committee_length.to_be_bytes()[..],
            self.ars_root.as_ref(),
            self.data_request_root.as_ref(),
            &self.index.to_be_bytes()[..],
            self.last_block.as_ref(),
            self.last_block_in_previous_superblock.as_ref(),
            self.tally_root.as_ref(),
        ]
        .concat()
    }

    /// Generate a Proof of Inclusion for a given Superblock DR root, provided the DR transaction
    /// and the blocks that the superblock contains
    /// If the DR transaction is not found within those blocks, returns None
    pub fn dr_proof_of_inclusion(
        &self,
        blocks: &[Block],
        dr_tx: &DRTransaction,
    ) -> Option<TxInclusionProof> {
        // Get the PoI for the block root, if the data request is found on the list of blocks
        // Obtain also the index of the dr root of the block containing the Dr TX.
        let (mut poi, dr_root_idx) = blocks
            .iter()
            .enumerate()
            .find_map(|(idx, b)| Some((dr_tx.data_proof_of_inclusion(b)?, idx)))?;

        // Collect all DR roots from the blocks
        let dr_roots = blocks
            .iter()
            .map(|b| b.block_header.merkle_roots.dr_hash_merkle_root);

        // Generate the second PoI, using the block DR root as a leave
        let second_poi = TxInclusionProof::new_with_hashes(dr_root_idx, dr_roots);

        // Concatenate one PoI with the second. This will update the index and append the siblings
        poi.concat(second_poi);

        Some(poi)
    }

    /// Generate a Proof of Inclusion for a given Superblock tally root, provided the tally transaction
    /// and the blocks that the superblock contains
    /// If the tally transaction is not found within those blocks, returns None
    pub fn tally_proof_of_inclusion(
        &self,
        blocks: &[Block],
        tally_tx: &TallyTransaction,
        protocol_version: ProtocolVersion,
    ) -> Option<TxInclusionProof> {
        // Get the PoI for the block root, if the tally transaction is found on the list of blocks
        // Obtain also the index of the tally root of the block containing the tally TX.
        let (mut poi, tally_root_idx) = blocks.iter().enumerate().find_map(|(idx, b)| {
            Some((tally_tx.data_proof_of_inclusion(b, protocol_version)?, idx))
        })?;

        // Collect all tally roots from the blocks
        let tally_roots = blocks
            .iter()
            .map(|b| b.block_header.merkle_roots.tally_hash_merkle_root);

        // Generate the second PoI, using the block tally root as a leave
        let second_poi = TxInclusionProof::new_with_hashes(tally_root_idx, tally_roots);

        // Concatenate one PoI with the second. This will update the index and append the siblings
        poi.concat(second_poi);

        Some(poi)
    }
}

/// Superblock votes as sent through the network
#[derive(Debug, Eq, PartialEq, Clone, Hash, ProtobufConvert, Serialize, Deserialize)]
#[protobuf_convert(pb = "crate::proto::schema::witnet::SuperBlockVote")]
pub struct SuperBlockVote {
    /// BN256 signature of `superblock_index` and `superblock_hash`
    pub bn256_signature: Bn256Signature,
    /// secp256k1 signature of `superblock_index`, `superblock_hash`, and `bn256_signature`
    pub secp256k1_signature: KeyedSignature,
    /// Hash of the superblock that this vote is voting for
    pub superblock_hash: Hash,
    /// Index of the superblock that this vote is voting for
    pub superblock_index: u32,
}

impl SuperBlockVote {
    /// Create a new vote for the `superblock_hash`, but do not sign it.
    /// The vote needs to be signed with a BN256 key, and that signature must
    /// later be signed with a secp256k1 key
    pub fn new_unsigned(superblock_hash: Hash, superblock_index: Epoch) -> Self {
        Self {
            superblock_hash,
            bn256_signature: Bn256Signature { signature: vec![] },
            secp256k1_signature: Default::default(),
            superblock_index,
        }
    }
    /// Set the BN256 signature. This invalidates any previous secp256k1 signature, so the
    /// secp256k1 signature must always be created after setting the BN256 signature.
    /// Use `bn256_signature_message()` to get the bytes that need to be signed.
    pub fn set_bn256_signature(&mut self, bn256_signature: Bn256Signature) {
        self.bn256_signature = bn256_signature;
    }
    /// Set the secp256k1 signature.
    /// Use `secp256k1_signature_message()` to get the bytes that need to be signed.
    pub fn set_secp256k1_signature(&mut self, secp256k1_signature: KeyedSignature) {
        self.secp256k1_signature = secp256k1_signature;
    }
    /// The message to be signed with the secp256k1 key is the concatenation
    /// of the superblock index in big endian and the hash of the superblock as bytes
    pub fn bn256_signature_message(&self) -> Vec<u8> {
        [
            &self.superblock_index.to_be_bytes()[..],
            self.superblock_hash.as_ref(),
        ]
        .concat()
    }
    /// The message to be signed with the secp256k1 key is the concatenation
    /// of the superblock index in big endian, the hash of the superblock and the BN256 signature as bytes:
    pub fn secp256k1_signature_message(&self) -> Vec<u8> {
        [
            &self.superblock_index.to_be_bytes()[..],
            self.superblock_hash.as_ref(),
            &self.bn256_signature.signature,
        ]
        .concat()
    }
}

/// Digital signatures structure (based on supported cryptosystems)
#[derive(Debug, Eq, PartialEq, Clone, Hash, Serialize, Deserialize, ProtobufConvert)]
#[protobuf_convert(pb = "crate::proto::schema::witnet::Signature")]
pub enum Signature {
    /// ECDSA over secp256k1
    Secp256k1(Secp256k1Signature),
}

impl Hashable for Signature {
    fn hash(&self) -> Hash {
        match self {
            Signature::Secp256k1(y) => calculate_sha256(&y.der).into(),
        }
    }
}

impl Default for Signature {
    fn default() -> Self {
        Signature::Secp256k1(Secp256k1Signature::default())
    }
}

impl Signature {
    /// Serialize the Signature for interoperability with OpenSSL.
    pub fn to_bytes(&self) -> Result<[u8; 64], failure::Error> {
        match self {
            Secp256k1(x) => {
                let signature = Secp256k1_Signature::from_der(x.der.as_slice())
                    .map_err(|_| Secp256k1ConversionError::FailSignatureConversion)?;

                Ok(signature.serialize_compact())
            }
        }
    }

    pub fn verify(
        &self,
        msg: &Message,
        public_key: &Secp256k1_PublicKey,
    ) -> Result<(), failure::Error> {
        match self {
            Secp256k1(x) => {
                let signature = Secp256k1_Signature::from_der(x.der.as_slice())
                    .map_err(|_| Secp256k1ConversionError::FailSignatureConversion)?;

                signature
                    .verify(msg, public_key)
                    .map_err(|inner| Secp256k1ConversionError::Secp256k1 { inner })?;

                Ok(())
            }
        }
    }
}

/// ECDSA (over secp256k1) signature
#[derive(Debug, Default, Eq, PartialEq, Clone, Hash, Serialize, Deserialize, ProtobufConvert)]
#[protobuf_convert(pb = "crate::proto::schema::witnet::Secp256k1Signature")]
pub struct Secp256k1Signature {
    /// The signature serialized in DER
    pub der: Vec<u8>,
}

impl From<Secp256k1_Signature> for Signature {
    fn from(secp256k1_signature: Secp256k1_Signature) -> Self {
        Signature::Secp256k1(Secp256k1Signature::from(secp256k1_signature))
    }
}

impl TryInto<Secp256k1_Signature> for Signature {
    type Error = failure::Error;

    fn try_into(self) -> Result<Secp256k1_Signature, Self::Error> {
        let x = match self {
            Signature::Secp256k1(y) => Secp256k1Signature::try_into(y)?,
        };
        Ok(x)
    }
}

impl From<Secp256k1_Signature> for Secp256k1Signature {
    fn from(secp256k1_signature: Secp256k1_Signature) -> Self {
        let der = secp256k1_signature.serialize_der().to_vec();

        Secp256k1Signature { der }
    }
}

impl TryInto<Secp256k1_Signature> for Secp256k1Signature {
    type Error = failure::Error;

    fn try_into(self) -> Result<Secp256k1_Signature, Self::Error> {
        Secp256k1_Signature::from_der(&self.der)
            .map_err(|_| Secp256k1ConversionError::FailSignatureConversion.into())
    }
}

impl From<Secp256k1_PublicKey> for PublicKey {
    fn from(secp256k1_pk: Secp256k1_PublicKey) -> Self {
        let serialize = secp256k1_pk.serialize();

        PublicKey::from_bytes(serialize)
    }
}

impl TryInto<Secp256k1_PublicKey> for PublicKey {
    type Error = failure::Error;

    fn try_into(self) -> Result<Secp256k1_PublicKey, Self::Error> {
        Secp256k1_PublicKey::from_slice(&self.to_bytes())
            .map_err(|_| Secp256k1ConversionError::FailPublicKeyConversion.into())
    }
}

impl From<Secp256k1_SecretKey> for SecretKey {
    fn from(secp256k1_sk: Secp256k1_SecretKey) -> Self {
        let bytes = Protected::from(&secp256k1_sk[..]);

        SecretKey { bytes }
    }
}

impl From<SecretKey> for Secp256k1_SecretKey {
    fn from(sk: SecretKey) -> Self {
        Secp256k1_SecretKey::from_slice(&sk.bytes).unwrap()
    }
}

impl From<ExtendedSK> for ExtendedSecretKey {
    fn from(extended_sk: ExtendedSK) -> Self {
        ExtendedSecretKey {
            secret_key: SecretKey {
                bytes: extended_sk.secret(),
            },
            chain_code: extended_sk.chain_code(),
        }
    }
}

impl From<ExtendedSecretKey> for ExtendedSK {
    fn from(ext_sk: ExtendedSecretKey) -> Self {
        let secret_key = ext_sk.secret_key.into();

        ExtendedSK::new(secret_key, ext_sk.chain_code)
    }
}

/// Hash
#[derive(Eq, PartialEq, Ord, PartialOrd, Copy, Clone, Hash, ProtobufConvert)]
#[protobuf_convert(pb = "crate::proto::schema::witnet::Hash")]
pub enum Hash {
    /// SHA-256 Hash
    SHA256(SHA256),
}

impl Default for Hash {
    fn default() -> Hash {
        Hash::SHA256([0; 32])
    }
}

/// Conversion between witnet_crypto::Sha256 and witnet_data_structures::Hash
impl From<Sha256> for Hash {
    fn from(x: Sha256) -> Self {
        Hash::SHA256(x.0)
    }
}

impl From<Vec<u8>> for Hash {
    fn from(x: Vec<u8>) -> Self {
        let mut hash = [0u8; 32];
        hash[..32].clone_from_slice(&x[..32]);

        Hash::SHA256(hash)
    }
}

impl AsRef<[u8]> for Hash {
    fn as_ref(&self) -> &[u8] {
        match self {
            Hash::SHA256(bytes) => bytes.as_ref(),
        }
    }
}

impl From<Hash> for Sha256 {
    fn from(h: Hash) -> Self {
        match h {
            Hash::SHA256(x) => Sha256(x),
        }
    }
}

impl fmt::Display for Hash {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        match self {
            Hash::SHA256(h) => f.write_str(
                h.iter()
                    .fold(String::new(), |acc, x| format!("{}{:02x}", acc, x))
                    .as_str(),
            )?,
        };

        Ok(())
    }
}

impl Hash {
    /// Create a Hash which is all zeros except the first 4 bytes,
    /// which correspond to the bytes of `x` in big endian
    pub fn with_first_u32(x: u32) -> Hash {
        let mut h: [u8; 32] = [0xFF; 32];
        let [h0, h1, h2, h3] = x.to_be_bytes();
        h[0] = h0;
        h[1] = h1;
        h[2] = h2;
        h[3] = h3;

        Hash::SHA256(h)
    }

    /// Return `(self / n, self % n)` using the same semantics as the EVM: interpret the hash as a
    /// 256-bit big endian unsigned integer.
    ///
    /// # Panics
    ///
    /// If n is 0 because of a division by zero.
    pub fn div_mod(&self, n: u64) -> (Hash, u64) {
        let hash_u256 = U256::from_big_endian(self.as_ref());
        let n_u256 = U256::from(n);
        let (d, m) = hash_u256.div_mod(n_u256);
        let d_hash = Hash::SHA256(SHA256::from(d));
        // m will always be smaller than n, so it must fit into a u64
        let m_u64 = m.low_u64();

        (d_hash, m_u64)
    }

    /// Obtains the bytes that represent the hash digest.
    ///
    /// This allows for compatibility with functions that take hashes and other data as raw bytes without a newtype or
    /// any other kind of wrapper.
    pub fn data(&self) -> [u8; 32] {
        match self {
            Hash::SHA256(bytes) => *bytes,
        }
    }

    // Creates an instance of Hash where all bytes are set to their minimum value (0).
    pub fn min() -> Self {
        Self::SHA256([u8::MIN; 32])
    }

    /// Creates an instance of Hash where all bytes are set to their maximum value (255).
    pub fn max() -> Self {
        Self::SHA256([u8::MAX; 32])
    }
}

/// Error when parsing hash from string
#[derive(Debug, Fail)]
pub enum HashParseError {
    /// Failed to parse string as hex
    #[fail(display = "Failed to parse hex: {}", _0)]
    Hex(#[cause] hex::FromHexError),

    /// Invalid hash length
    #[fail(display = "Invalid hash length: expected 32 bytes but got {}", _0)]
    InvalidLength(usize),
}

impl FromStr for Hash {
    type Err = HashParseError;

    fn from_str(s: &str) -> Result<Self, Self::Err> {
        let mut h = [0; 32];

        match hex::decode_to_slice(s, &mut h) {
            Err(e) => Err(HashParseError::Hex(e)),
            Ok(_) => Ok(Hash::SHA256(h)),
        }
    }
}

impl fmt::Debug for Hash {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        write!(f, "{}", self)
    }
}

/// SHA-256 Hash
pub type SHA256 = [u8; 32];

/// Public Key Hash: slice of the digest of a public key (20 bytes).
///
/// It is the first 20 bytes of the SHA256 hash of the PublicKey.
#[derive(Copy, Clone, Debug, Default, Eq, PartialEq, Hash, ProtobufConvert, Ord, PartialOrd)]
#[protobuf_convert(pb = "crate::proto::schema::witnet::PublicKeyHash")]
pub struct PublicKeyHash {
    pub(crate) hash: [u8; 20],
}

impl PublicKeyHash {
    pub fn as_secp256k1_msg(&self) -> [u8; secp256k1::constants::MESSAGE_SIZE] {
        let mut msg = [0u8; secp256k1::constants::MESSAGE_SIZE];
        msg[0..20].clone_from_slice(self.as_ref());

        msg
    }
}

impl AsRef<[u8]> for PublicKeyHash {
    fn as_ref(&self) -> &[u8] {
        self.hash.as_ref()
    }
}

impl fmt::Display for PublicKeyHash {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        let address = self.bech32(get_environment());

        f.write_str(&address)
    }
}

impl Hashable for PublicKeyHash {
    fn hash(&self) -> Hash {
        calculate_sha256(&self.to_pb_bytes().unwrap()).into()
    }
}

/// Error when parsing `PublicKeyHash` from string
#[derive(Debug, Fail)]
pub enum PublicKeyHashParseError {
    /// Failed to parse string as hex
    #[fail(display = "Failed to parse hex: {}", _0)]
    Hex(#[cause] hex::FromHexError),

    /// Invalid `PublicKeyHash` length
    #[fail(
        display = "Invalid PublicKeyHash length: expected 20 bytes but got {}",
        _0
    )]
    InvalidLength(usize),

    /// Tried to use testnet address in mainnet or vice versa
    #[fail(
        display = "Address is for different environment: prefix \"{}\" is not valid for {}",
        prefix, expected_environment
    )]
    WrongEnvironment {
        /// The prefix found in the string
        prefix: String,
        /// The environment the node is running in
        expected_environment: Environment,
    },

    /// Failed to parse string as Bech32
    #[fail(display = "Failed to deserialize Bech32: {}", _0)]
    Bech32(#[cause] bech32::Error),
}

impl FromStr for PublicKeyHash {
    type Err = PublicKeyHashParseError;

    fn from_str(s: &str) -> Result<Self, Self::Err> {
        Self::from_bech32(get_environment(), s)
    }
}

impl PublicKeyHash {
    /// Calculate the hash of the provided public key
    pub fn from_public_key(pk: &PublicKey) -> Self {
        let mut pkh = [0; 20];
        let Hash::SHA256(h) = pk.hash();
        pkh.copy_from_slice(&h[..20]);

        Self { hash: pkh }
    }

    /// Create from existing bytes representing the PKH.
    pub fn from_bytes(bytes: &[u8]) -> Result<Self, PublicKeyHashParseError> {
        let len = bytes.len();

        match len {
            20 => {
                let mut pkh = [0; 20];
                pkh.copy_from_slice(bytes);

                Ok(Self { hash: pkh })
            }
            _ => Err(PublicKeyHashParseError::InvalidLength(len)),
        }
    }

    /// Serialize the PKH as hex bytes
    pub fn to_hex(self) -> String {
        self.hash
            .iter()
            .fold(String::new(), |acc, x| format!("{}{:02x}", acc, x))
    }

    /// Deserialize PKH from hex bytes
    pub fn from_hex(s: &str) -> Result<Self, PublicKeyHashParseError> {
        let mut hash = [0; 20];

        match hex::decode_to_slice(s, &mut hash) {
            Err(e) => Err(PublicKeyHashParseError::Hex(e)),
            Ok(_) => Ok(PublicKeyHash { hash }),
        }
    }

    /// Serialize PKH according to Bech32
    pub fn bech32(&self, environment: Environment) -> String {
        // This unwrap is safe because every PKH will serialize correctly,
        // and every possible prefix is valid according the Bech32 rules
        bech32::encode(environment.bech32_prefix(), self.hash.to_base32()).unwrap()
    }

    /// Deserialize PKH according to Bech32, checking prefix to avoid mixing mainnet and testned addresses
    pub fn from_bech32(
        environment: Environment,
        address: &str,
    ) -> Result<Self, PublicKeyHashParseError> {
        let (prefix, pkh_u5) = bech32::decode(address).map_err(PublicKeyHashParseError::Bech32)?;
        let pkh_vec = Vec::from_base32(&pkh_u5).map_err(PublicKeyHashParseError::Bech32)?;

        let expected_prefix = environment.bech32_prefix();

        if prefix != expected_prefix {
            Err(PublicKeyHashParseError::WrongEnvironment {
                prefix,
                expected_environment: environment,
            })
        } else {
            Self::from_bytes(&pkh_vec)
        }
    }
}

/// Input data structure
#[derive(
    Debug, Default, Eq, PartialEq, Copy, Clone, Serialize, Deserialize, ProtobufConvert, Hash,
)]
#[protobuf_convert(pb = "crate::proto::schema::witnet::Input")]
pub struct Input {
    output_pointer: OutputPointer,
}

impl Input {
    /// Create a new Input from an OutputPointer
    pub fn new(output_pointer: OutputPointer) -> Self {
        Self { output_pointer }
    }
    /// Return the [`OutputPointer`](OutputPointer) of an input.
    pub fn output_pointer(&self) -> &OutputPointer {
        &self.output_pointer
    }
    /// Return the [`OutputPointer`](OutputPointer) of an input.
    pub fn into_output_pointer(self) -> OutputPointer {
        self.output_pointer
    }
}

/// Value transfer output transaction data structure
#[derive(Debug, Eq, PartialEq, Clone, Serialize, Deserialize, ProtobufConvert, Hash, Default)]
#[protobuf_convert(pb = "crate::proto::schema::witnet::ValueTransferOutput")]
pub struct ValueTransferOutput {
    /// Address that will receive the value
    pub pkh: PublicKeyHash,
    /// Transferred value in nanowits
    pub value: u64,
    /// The value attached to a time-locked output cannot be spent before the specified
    /// timestamp. That is, they cannot be used as an input in any transaction of a
    /// subsequent block proposed for an epoch whose opening timestamp predates the time lock.
    pub time_lock: u64,
}

impl ValueTransferOutput {
    #[inline]
    pub fn value(&self) -> u64 {
        self.value
    }

    #[inline]
    pub fn weight(&self) -> u32 {
        OUTPUT_SIZE
    }
}

/// Data request output transaction data structure
#[derive(Debug, Eq, PartialEq, Clone, Serialize, Deserialize, ProtobufConvert, Hash, Default)]
#[protobuf_convert(pb = "crate::proto::schema::witnet::DataRequestOutput")]
pub struct DataRequestOutput {
    /// Data request structure
    pub data_request: RADRequest,
    /// Reward in nanowits that will be earned by honest witnesses
    pub witness_reward: u64,
    /// Number of witnesses that will resolve this data request
    pub witnesses: u16,
    /// This fee will be earn by the miner when include commits and/or reveals in the block
    pub commit_and_reveal_fee: u64,
    /// The minimum percentage of non-error reveals required to consider this data request as
    /// "resolved" instead of as "error".
    /// This field must be >50 and <100.
    /// \>50 because simple majority
    /// <100 because a 100% consensus encourages to commit a RadError for free
    pub min_consensus_percentage: u32,
    /// The amount of nanowits that each witness must collateralize in order to claim eligibility of
    /// this data request.
    /// This field must be >= collateral_minimum, or zero.
    /// If zero, it will be treated as collateral_minimum.
    pub collateral: u64,
}

impl DataRequestOutput {
    /// Calculate the total value of a data request, return error on overflow
    ///
    /// ```ignore
    /// total_value = (witness_reward + commit_and_reveal_fee + commit_and_reveal_fee) * witnesses
    /// ```
    pub fn checked_total_value(&self) -> Result<u64, TransactionError> {
        self.witness_reward
            .checked_add(self.commit_and_reveal_fee)
            .and_then(|res| res.checked_add(self.commit_and_reveal_fee))
            .and_then(|res| res.checked_mul(u64::from(self.witnesses)))
            .ok_or(TransactionError::FeeOverflow)
    }

    /// Returns the DataRequestOutput weight
    pub fn weight(&self) -> u32 {
        // Witness reward: 8 bytes
        // Witnesses: 2 bytes
        // commit_and_reveal_fee: 8 bytes
        // min_consensus_percentage: 4 bytes
        // collateral: 8 bytes

        self.data_request.weight().saturating_add(8 + 2 + 8 + 4 + 8)
    }

    /// Data Request extra weight related by commits, reveals and tally
    pub fn extra_weight(&self) -> u32 {
        let witnesses = u32::from(self.witnesses);
        let commits_weight = witnesses.saturating_mul(COMMIT_WEIGHT);
        let reveals_weight = witnesses.saturating_mul(REVEAL_WEIGHT).saturating_mul(BETA);
        let tally_outputs_weight = witnesses.saturating_mul(OUTPUT_SIZE);
        let tally_weight = TALLY_WEIGHT
            .saturating_mul(BETA)
            .saturating_add(tally_outputs_weight);

        commits_weight
            .saturating_add(reveals_weight)
            .saturating_add(tally_weight)
    }
}

#[derive(Debug, Default, Eq, PartialEq, Clone, Hash, Serialize, Deserialize, ProtobufConvert)]
#[protobuf_convert(pb = "crate::proto::schema::witnet::StakeOutput")]
pub struct StakeOutput {
    pub authorization: KeyedSignature,
    pub key: StakeKey<PublicKeyHash>,
    pub value: u64,
}

impl StakeOutput {
    #[inline]
    pub fn weight(&self) -> u32 {
        crate::transaction::STAKE_OUTPUT_WEIGHT
    }
}

pub enum Output {
    DataRequest(DataRequestOutput),
    Stake(StakeOutput),
    ValueTransfer(ValueTransferOutput),
}

impl Output {
    pub fn value(&self) -> Result<u64, TransactionError> {
        match self {
            Output::DataRequest(output) => output.checked_total_value(),
            Output::Stake(output) => Ok(output.value),
            Output::ValueTransfer(output) => Ok(output.value),
        }
    }

    pub fn weight(&self) -> u32 {
        match self {
            Output::DataRequest(output) => output.weight(),
            Output::Stake(output) => output.weight(),
            Output::ValueTransfer(output) => output.weight(),
        }
    }
}

/// Information about the total supply
#[derive(Clone, Debug, Serialize, Deserialize)]
pub struct SupplyInfo {
    /// Current epoch
    pub epoch: u32,
    /// Current time
    pub current_time: u64,
    /// Number of blocks minted
    pub blocks_minted: u32,
    /// WIT minted through block creation
    pub blocks_minted_reward: u64,
    /// Number of blocks missing
    pub blocks_missing: u32,
    /// WIT missing because a block was not created
    pub blocks_missing_reward: u64,
    /// Amount of in-flight data requests
    pub in_flight_requests: u32,
    /// Supply currently locked in data requests
    pub locked_wits_by_requests: u64,
    /// Current unlocked supply
    pub current_unlocked_supply: u64,
    /// Current locked supply
    pub current_locked_supply: u64,
    /// Maximum supply: the number of nanowits that will ever exist
    pub maximum_supply: u64,
}

/// Information about the total supply after V1_8 activation
#[derive(Clone, Debug, Serialize, Deserialize)]
pub struct SupplyInfo2 {
    /// Current epoch
    pub epoch: u32,
    /// Current time
    pub current_time: u64,
    /// Number of blocks minted
    pub blocks_minted: u32,
    /// WIT minted through block creation
    pub blocks_minted_reward: u64,
    /// Amount of nanowits that have been burnt so far
    pub burnt_supply: u64,
    /// Current locked supply (includes in_flight_requests_collateral)
    pub current_locked_supply: u64,
    /// Current staked supply
    pub current_staked_supply: u64,
    /// Current unlocked supply
    pub current_unlocked_supply: u64,
    /// Initial supply
    pub initial_supply: u64,
    /// WIT currently locked as collateral by in-flight data requests
    pub requests_in_flight_collateral: u64,
}

/// Keyed signature data structure
#[derive(Debug, Default, Eq, PartialEq, Clone, Hash, Serialize, Deserialize, ProtobufConvert)]
#[protobuf_convert(pb = "crate::proto::schema::witnet::KeyedSignature")]
pub struct KeyedSignature {
    /// Signature
    pub signature: Signature,
    /// Public key
    pub public_key: PublicKey,
}

impl KeyedSignature {
    pub fn from_recoverable_hex(
        string: &str,
        msg: &[u8],
    ) -> Result<Self, Secp256k1ConversionError> {
        let bytes = hex::decode(string).map_err(|e| Secp256k1ConversionError::HexDecode {
            hex: String::from(string),
            inner: e,
        })?;

        Self::from_recoverable_slice(&bytes, msg)
    }
    pub fn from_recoverable(
        recoverable: &RecoverableSignature,
        message: &[u8],
    ) -> Result<Self, Secp256k1ConversionError> {
        let msg = secp256k1::Message::from_digest_slice(message)
            .map_err(|e| Secp256k1ConversionError::Secp256k1 { inner: e })?;
        let signature = recoverable.to_standard();
        let public_key = recoverable
            .recover(&msg)
            .map_err(|e| Secp256k1ConversionError::Secp256k1 { inner: e })?;

        Ok(KeyedSignature {
            signature: signature.into(),
            public_key: public_key.into(),
        })
    }

    // Recovers a keyed signature from its serialized form and a known message.
    pub fn from_recoverable_slice(
        compact: &[u8],
        message: &[u8],
    ) -> Result<Self, Secp256k1ConversionError> {
        let recid = RecoveryId::from_i32(i32::from(compact[0]))
            .map_err(|e| Secp256k1ConversionError::Secp256k1 { inner: e })?;
        let recoverable = RecoverableSignature::from_compact(&compact[1..], recid)
            .map_err(|e| Secp256k1ConversionError::Secp256k1 { inner: e })?;

        Self::from_recoverable(&recoverable, message)
    }

    /// Serializes a `KeyedSignature` into a compact encoding form that contains the public key recovery ID as a prefix.
    pub fn to_recoverable_bytes(
        self,
        message: &[u8],
    ) -> Result<[u8; 65], Secp256k1ConversionError> {
        let mut recoverable_bytes = [0; 65];
        let bytes = self
            .signature
            .to_bytes()
            .map_err(|e| Secp256k1ConversionError::Other {
                inner: e.to_string(),
            })?;
        recoverable_bytes[1..].clone_from_slice(&bytes);

        // Silly algorithm that tries recovery with different recovery IDs in an attempt to guess which one is correct,
        // provided that our `KeyedSignature` misses that information in comparison with `RecoverableSignature`
        for i in 0..4 {
            recoverable_bytes[0] = i;

            let recovered = KeyedSignature::from_recoverable_slice(&recoverable_bytes, message)?;

            if recovered.public_key == self.public_key {
                break;
            }
        }

        Ok(recoverable_bytes)
    }
}

/// Public Key data structure
#[derive(Debug, Default, Eq, PartialEq, Clone, Hash, Serialize, Deserialize)]
pub struct PublicKey {
    /// Byte indicating how to decompress the public key
    pub compressed: u8,
    /// Public key bytes
    pub bytes: [u8; 32],
}

impl PublicKey {
    /// Serialize the Public Key for interoperability with OpenSSL.
    pub fn to_bytes(&self) -> [u8; 33] {
        let mut v = [0; 33];
        v[0] = self.compressed;
        v[1..].copy_from_slice(&self.bytes);
        v
    }

    /// Deserialize the Public Key for interoperability with OpenSSL.
    pub fn from_bytes(serialized: [u8; 33]) -> Self {
        Self::try_from_slice(&serialized[..]).unwrap()
    }

    /// Deserialize the Public Key for interoperability with OpenSSL.
    /// Returns an error if the slice is not 33 bytes long.
    pub fn try_from_slice(serialized: &[u8]) -> Result<Self, Secp256k1ConversionError> {
        if serialized.len() != 33 {
            Err(Secp256k1ConversionError::FailPublicKeyFromSlice {
                size: serialized.len(),
            })
        } else {
            let mut x = [0; 32];
            x.copy_from_slice(&serialized[1..]);

            Ok(PublicKey {
                compressed: serialized[0],
                bytes: x,
            })
        }
    }

    /// Returns the PublicKeyHash related to the PublicKey
    pub fn pkh(&self) -> PublicKeyHash {
        PublicKeyHash::from_public_key(self)
    }
}

impl std::str::FromStr for PublicKey {
    type Err = Secp256k1ConversionError;

    fn from_str(s: &str) -> Result<Self, Self::Err> {
        Self::try_from_slice(s.as_bytes())
    }
}

/// Secret Key data structure
#[derive(Debug, Eq, PartialEq, Clone, Serialize, Deserialize)]
pub struct SecretKey {
    /// Bytes
    pub bytes: Protected,
}

/// Extended Secret Key data structure
#[derive(Debug, Eq, PartialEq, Clone, Serialize, Deserialize)]
pub struct ExtendedSecretKey {
    /// Secret key
    pub secret_key: SecretKey,
    /// Chain code
    pub chain_code: Protected,
}

// BLS data structures

/// BN256 public key
#[derive(Debug, Eq, PartialEq, Hash, Default, Clone, Serialize, Deserialize, ProtobufConvert)]
#[protobuf_convert(pb = "crate::proto::schema::witnet::Bn256PublicKey")]
pub struct Bn256PublicKey {
    /// Compressed form of a BN256 public key
    pub public_key: Vec<u8>,
    #[serde(skip)]
    #[protobuf_convert(skip)]
    // Cached uncompressed form
    uncompressed: Memoized<Vec<u8>>,
}

/// BN256 secret key
#[derive(Debug, Eq, PartialEq, Clone, Serialize, Deserialize)]
pub struct Bn256SecretKey {
    /// Bytes
    pub bytes: Protected,
}

/// BN256 signature
#[derive(Debug, Eq, PartialEq, Clone, Hash, Serialize, Deserialize, ProtobufConvert)]
#[protobuf_convert(pb = "crate::proto::schema::witnet::Bn256Signature")]
pub struct Bn256Signature {
    /// Signature
    pub signature: Vec<u8>,
}

/// BN256 signature and public key
#[derive(Debug, Eq, PartialEq, Clone, Hash, Serialize, Deserialize, ProtobufConvert)]
#[protobuf_convert(pb = "crate::proto::schema::witnet::Bn256KeyedSignature")]
pub struct Bn256KeyedSignature {
    /// Signature
    pub signature: Bn256Signature,
    /// Public key
    pub public_key: Bn256PublicKey,
}

impl Bn256PublicKey {
    /// Derive public key from secret key
    pub fn from_secret_key(secret_key: &Bn256SecretKey) -> Result<Self, failure::Error> {
        let public_key = Bn256.derive_public_key(&secret_key.bytes)?;

        Ok(Self {
            public_key,
            uncompressed: Memoized::default(),
        })
    }

    /// Interpret bytes as public key
    pub fn from_bytes(bytes: &[u8]) -> Result<Self, failure::Error> {
        // Verify that this slice is a valid public key
        let _ = bn256::PublicKey::from_compressed(bytes)?;

        Ok(Self {
            public_key: bytes.to_vec(),
            uncompressed: Memoized::default(),
        })
    }

    /// Convert public key to uncompressed format
    pub fn to_uncompressed(&self) -> Result<Vec<u8>, failure::Error> {
        // Use the cached uncompressed key, if it was already calculated
        if let Some(cached_uncompressed) = self.uncompressed.get_cloned() {
            return Ok(cached_uncompressed);
        }

        // If this is the first time we use to_uncompressed, perform this expensive conversion
        // from compressed to uncompressed, and save the result for later
        let uncompressed =
            bn256::PublicKey::from_compressed(&self.public_key)?.to_uncompressed()?;
        self.uncompressed.set(Some(uncompressed.clone()));

        Ok(uncompressed)
    }

    /// Return true if the public key is valid.
    /// Must have the correct length and the point must pertain to the curve.
    pub fn is_valid(&self) -> bool {
        // Verify that the provided key is a valid public key
        bn256::PublicKey::from_compressed(&self.public_key).is_ok()
    }

    /// Copy public key into a vector of bytes
    pub fn to_bytes(&self) -> Vec<u8> {
        self.public_key.clone()
    }
}

impl Hashable for Bn256PublicKey {
    fn hash(&self) -> Hash {
        calculate_sha256(&self.to_uncompressed().unwrap()).into()
    }
}

impl Bn256SecretKey {
    /// Interpret bytes as secret key
    pub fn from_slice(bytes: &[u8]) -> Result<Self, failure::Error> {
        // Verify that this slice is a valid secret key
        let _ = bn256::PrivateKey::new(bytes)?;

        Ok(Self {
            bytes: bytes.to_vec().into(),
        })
    }

    /// Use the secret key to sign a message.
    /// The message can be of any length, and it will be hashed internally.
    pub fn sign(&self, message: &[u8]) -> Result<Bn256Signature, failure::Error> {
        let signature = Bn256.sign(&self.bytes, message)?;

        Ok(Bn256Signature { signature })
    }
}

impl Hashable for Bn256Signature {
    fn hash(&self) -> Hash {
        calculate_sha256(&self.signature).into()
    }
}

/// Retrieval type
#[derive(Debug, Default, Eq, PartialEq, Clone, Serialize, Deserialize, Hash)]
pub enum RADType {
    /// Unknown
    #[default]
    #[serde(rename = "Unknown")]
    Unknown,
    /// HTTP GET request
    #[serde(rename = "HTTP-GET")]
    HttpGet,
    /// Random number generation
    #[serde(rename = "RNG")]
    Rng,
    /// HTTP POST request
    #[serde(rename = "HTTP-POST")]
    HttpPost,
    /// HTTP HEAD request
    #[serde(rename = "HTTP-HEAD")]
    HttpHead,
}

impl RADType {
    pub fn is_http(&self) -> bool {
        matches!(
            self,
            RADType::HttpGet | RADType::HttpPost | RADType::HttpHead
        )
    }
}

/// RAD request data structure
#[derive(Clone, Debug, Default, Eq, PartialEq, Serialize, Deserialize, ProtobufConvert, Hash)]
#[protobuf_convert(
    pb = "crate::proto::schema::witnet::DataRequestOutput_RADRequest",
    crate = "crate"
)]
pub struct RADRequest {
    /// Commitments for this request will not be accepted in any block proposed for an epoch
    /// whose opening timestamp predates the specified time lock. This effectively prevents
    /// a request from being processed before a specific future point in time.
    pub time_lock: u64,
    /// List of retrieval sources and scripts
    pub retrieve: Vec<RADRetrieve>,
    /// Aggregate script
    pub aggregate: RADAggregate,
    /// Tally script
    pub tally: RADTally,
}

impl RADRequest {
    /// Return the weight, used to enforce the block size limit.
    pub fn weight(&self) -> u32 {
        // Time lock: 8 bytes

        let mut retrievals_weight: u32 = 0;
        for i in self.retrieve.iter() {
            retrievals_weight = retrievals_weight.saturating_add(i.weight());
        }

        retrievals_weight
            .saturating_add(self.aggregate.weight())
            .saturating_add(self.tally.weight())
            .saturating_add(8)
    }
}

/// Retrieve script and source
#[derive(Debug, Eq, PartialEq, Clone, ProtobufConvert, Hash, Default)]
#[protobuf_convert(
    pb = "crate::proto::schema::witnet::DataRequestOutput_RADRequest_RADRetrieve",
    crate = "crate"
)]
pub struct RADRetrieve {
    /// Kind of retrieval
    pub kind: RADType,
    /// URL
    pub url: String,
    /// Serialized RADON script
    pub script: Vec<u8>,
    /// Body of a HTTP-POST request
    pub body: Vec<u8>,
    /// Extra headers of a HTTP-GET, HTTP-POST or HTTP-HEAD request
    pub headers: Vec<(String, String)>,
}

#[derive(Debug, Copy, Clone, Hash, PartialEq, Eq)]
enum Field {
    Kind,
    Url,
    Script,
    Body,
    Headers,
}

impl std::fmt::Display for Field {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        match self {
            Field::Kind => write!(f, "kind"),
            Field::Url => write!(f, "url"),
            Field::Script => write!(f, "script"),
            Field::Body => write!(f, "body"),
            Field::Headers => write!(f, "headers"),
        }
    }
}

impl RADRetrieve {
    fn field_checker(&self) -> impl Fn(&[Field], &[Field]) -> Result<(), DataRequestError> + '_ {
        fn is_default<T: Default + PartialEq>(x: &T) -> bool {
            x == &T::default()
        }

        fn hs_to_string(hs: &HashSet<Field>) -> String {
            let mut s = String::new();
            let mut field_names: Vec<String> = hs.iter().map(|field| field.to_string()).collect();
            field_names.sort();

            for field in field_names {
                write!(s, "{}, ", field).unwrap();
            }

            // Remove last ", "
            if !s.is_empty() {
                s.truncate(s.len() - 2);
            }

            s
        }

        // Initialize list of present fields with all the fields that have a non-default value
        let mut present_fields = HashSet::new();

        if !is_default(&self.kind) {
            present_fields.insert(Field::Kind);
        }
        if !is_default(&self.url) {
            present_fields.insert(Field::Url);
        }
        if !is_default(&self.script) {
            present_fields.insert(Field::Script);
        }
        if !is_default(&self.body) {
            present_fields.insert(Field::Body);
        }
        if !is_default(&self.headers) {
            present_fields.insert(Field::Headers);
        }

        move |expected_fields: &[Field], optional_fields: &[Field]| {
            let expected_fields: HashSet<Field> = expected_fields.iter().cloned().collect();
            let optional_fields: HashSet<Field> = optional_fields.iter().cloned().collect();

            // This must hold true:
            // present_fields - optional_fields == expected_fields
            let diff: HashSet<Field> = present_fields
                .difference(&optional_fields)
                .cloned()
                .collect();
            if diff == expected_fields {
                Ok(())
            } else {
                Err(DataRequestError::MalformedRetrieval {
                    kind: self.kind.clone(),
                    expected_fields: hs_to_string(&expected_fields),
                    actual_fields: hs_to_string(&diff),
                })
            }
        }
    }
    /// Check whether the fields of the `RADRetrieve` are compatible with the kind of retrieval.
    ///
    /// Returns an error if any of the fields that should not exist (because they cannot be used
    /// for this retrieval kind) has a value different from the default.
    pub fn check_fields(&self) -> Result<(), DataRequestError> {
        let check = self.field_checker();

        match &self.kind {
            RADType::Unknown => {
                // Anything is fine
                Ok(())
            }
            RADType::HttpGet => check(&[Field::Kind, Field::Url, Field::Script], &[Field::Headers]),
            RADType::Rng => check(&[Field::Kind, Field::Script], &[]),
            RADType::HttpPost => {
                // In HttpPost the body is optional because empty body should also be allowed
                check(
                    &[Field::Kind, Field::Url, Field::Script],
                    &[Field::Body, Field::Headers],
                )
            }
            RADType::HttpHead => {
                check(&[Field::Kind, Field::Url, Field::Script], &[Field::Headers])
            }
        }
    }

    /// Check whether the fields of the `RADRetrieve` are compatible with the kind of retrieval.
    ///
    /// Returns an error if any of the fields that should not exist (because they cannot be used
    /// for this retrieval kind) has a value different from the default.
    ///
    /// This is used to ensure that new fields added in WIP0020 are considered invalid before the
    /// WIP activation.
    pub fn check_fields_before_wip0020(&self) -> Result<(), DataRequestError> {
        let check = self.field_checker();

        match &self.kind {
            RADType::Unknown => {
                // Anything is fine. This branch can only be reached before WIP0019, when validating
                // requests from old blocks.
                Ok(())
            }
            RADType::HttpGet => check(&[Field::Kind, Field::Url, Field::Script], &[]),
            // There was a bug, and RNG requests could have an optional url field which was ignored
            RADType::Rng => check(&[Field::Kind, Field::Script], &[Field::Url]),
            _ => Err(DataRequestError::InvalidRadType),
        }
    }

    /// Return the weight, used to enforce the block size limit.
    pub fn weight(&self) -> u32 {
        let kind_weight = 1;
        let script_weight = u32::try_from(self.script.len()).unwrap_or(u32::MAX);
        let url_weight = u32::try_from(self.url.len()).unwrap_or(u32::MAX);
        let body_weight = u32::try_from(self.body.len()).unwrap_or(u32::MAX);
        let mut headers_weight: u32 = 0;
        for (key, value) in &self.headers {
            let key_weight = u32::try_from(key.len()).unwrap_or(u32::MAX);
            let value_weight = u32::try_from(value.len()).unwrap_or(u32::MAX);
            // Approximation of the protobuf serialization overhead of `repeated StringPair`.
            // See `rad_retrieve_header_overhead` test for more information.
            let header_overhead = 6;

            headers_weight = headers_weight
                .saturating_add(key_weight)
                .saturating_add(value_weight)
                .saturating_add(header_overhead);
        }

        script_weight
            .saturating_add(url_weight)
            .saturating_add(kind_weight)
            .saturating_add(body_weight)
            .saturating_add(headers_weight)
    }
}

/// Filter stage
#[derive(Debug, Eq, PartialEq, Clone, Serialize, Deserialize, ProtobufConvert, Hash, Default)]
#[protobuf_convert(
    pb = "crate::proto::schema::witnet::DataRequestOutput_RADRequest_RADFilter",
    crate = "crate"
)]
pub struct RADFilter {
    /// `RadonFilters` code
    pub op: u32,
    /// Serialized filter arguments
    pub args: Vec<u8>,
}

impl RADFilter {
    /// Return the weight, used to enforce the block size limit.
    pub fn weight(&self) -> u32 {
        // op: 4 bytes
        let args_weight = u32::try_from(self.args.len()).unwrap_or(u32::MAX);

        args_weight.saturating_add(4)
    }
}

/// Aggregate stage
#[derive(Debug, Eq, PartialEq, Clone, Serialize, Deserialize, ProtobufConvert, Hash, Default)]
#[protobuf_convert(
    pb = "crate::proto::schema::witnet::DataRequestOutput_RADRequest_RADAggregate",
    crate = "crate"
)]
pub struct RADAggregate {
    /// List of filters to be applied in sequence
    pub filters: Vec<RADFilter>,
    /// `RadonReducers` opcode to be applied to the final result
    pub reducer: u32,
}

impl RADAggregate {
    /// Return the weight, used to enforce the block size limit.
    pub fn weight(&self) -> u32 {
        // reducer: 4 bytes

        let mut filters_weight: u32 = 0;
        for i in self.filters.iter() {
            filters_weight = filters_weight.saturating_add(i.weight());
        }

        filters_weight.saturating_add(4)
    }
}

/// Tally stage
#[derive(Debug, Eq, PartialEq, Clone, Serialize, Deserialize, ProtobufConvert, Hash, Default)]
#[protobuf_convert(
    pb = "crate::proto::schema::witnet::DataRequestOutput_RADRequest_RADTally",
    crate = "crate"
)]
pub struct RADTally {
    /// List of filters to be applied in sequence
    pub filters: Vec<RADFilter>,
    /// `RadonReducers` opcode to be applied to the final result
    pub reducer: u32,
}

impl RADTally {
    /// Return the weight, used to enforce the block size limit.
    pub fn weight(&self) -> u32 {
        // reducer: 4 bytes

        let mut filters_weight: u32 = 0;
        for i in self.filters.iter() {
            filters_weight = filters_weight.saturating_add(i.weight());
        }

        filters_weight.saturating_add(4)
    }
}

impl From<RADAggregate> for RADTally {
    fn from(aggregate: RADAggregate) -> Self {
        Self {
            filters: aggregate.filters,
            reducer: aggregate.reducer,
        }
    }
}

type PrioritizedHash = (OrderedFloat<f64>, Hash);
type PrioritizedVTTransaction = (OrderedFloat<f64>, VTTransaction);
type PrioritizedDRTransaction = (OrderedFloat<f64>, DRTransaction);
type PrioritizedStakeTransaction = (OrderedFloat<f64>, StakeTransaction);
type PrioritizedUnstakeTransaction = (OrderedFloat<f64>, UnstakeTransaction);

#[derive(Debug, Clone, Default)]
struct UnconfirmedTransactions {
    current: Vec<Hash>,
    previous: Vec<Hash>,
}

impl UnconfirmedTransactions {
    fn update(&mut self) {
        std::mem::swap(&mut self.previous, &mut self.current);
        self.current.clear();
    }

    fn insert(&mut self, h: Hash) {
        self.current.push(h);
    }

    fn clear(&mut self) {
        self.current.clear();
        self.previous.clear();
    }

    fn remove_all(&mut self) -> Vec<Hash> {
        let mut v = vec![];
        v.extend(self.current.iter());
        v.extend(self.previous.iter());
        self.clear();

        v
    }
}

/// A pool of validated transactions that supports constant access by
/// [`Hash`](Hash) and iteration over the
/// transactions sorted from by transactions with bigger fees to
/// transactions with smaller fees.
#[derive(Debug, Clone)]
pub struct TransactionsPool {
    vt_transactions: HashMap<Hash, PrioritizedVTTransaction>,
    sorted_vt_index: BTreeSet<PrioritizedHash>,
    dr_transactions: HashMap<Hash, PrioritizedDRTransaction>,
    sorted_dr_index: BTreeSet<PrioritizedHash>,
    // Index commits by transaction hash
    co_hash_index: HashMap<Hash, CommitTransaction>,
    // A map of `data_request_hash` to a map of `commit_pkh` to `commit_transaction_hash`
    co_transactions: HashMap<Hash, HashMap<PublicKeyHash, Hash>>,
    // Index reveals by transaction hash
    re_hash_index: HashMap<Hash, RevealTransaction>,
    // A map of `data_request_hash` to a map of `reveal_pkh` to `reveal_transaction_hash`
    re_transactions: HashMap<Hash, HashMap<PublicKeyHash, Hash>>,
    // Map to avoid double spending issues
    output_pointer_map: HashMap<OutputPointer, Vec<Hash>>,
    // Total size of all value transfer transactions inside the pool in weight units
    total_vt_weight: u64,
    // Total size of all data request transactions inside the pool in weight units
    total_dr_weight: u64,
    // Total size of all stake transactions inside the pool in weight units
    total_st_weight: u64,
    // Total size of all unstake transactions inside the pool in weight units
    total_ut_weight: u64,
    // TransactionsPool size limit in weight units
    weight_limit: u64,
    // Ratio of value transfer transaction to data request transaction that should be in the
    // transactions pool. This is used to decide what type of transaction should be removed when
    // the transactions pool is full.
    // Values greater than 1 mean keep more value transfer transactions than data request
    // transactions.
    vt_to_dr_factor: f64,
    // Minimum fee required to include a VTT into a block. We check for this fee in the
    // TransactionPool so we can choose not to insert a transaction we will not mine anyway.
    minimum_vtt_fee: u64,
    // Minimum valid collateral for a data request set from the consensus constants
    collateral_minimum: u64,
    // The required reward to collateral percentage for a data request to be accepted by the network.
    // If a data request is sent into the network with a lower percentage, a miner should simply
    // refuse to add the data request in its transaction pool. If the miner adds the data request
    // into a block, other miners will consider the block to be invalid.
    required_reward_collateral_ratio: u64,
    // Map for unconfirmed transactions
    unconfirmed_transactions: UnconfirmedTransactions,
    // TODO: refactor to use Rc<WriteLock<PrioritizedStakeTransaction>> or
    // Arc<Mutex<PrioritizedStakeTransaction>> to prevent the current indirect lookup (having to
    // first query the index for the hash, and then using the hash to find the actual data)
    st_transactions: HashMap<Hash, PrioritizedStakeTransaction>,
    sorted_st_index: BTreeSet<PrioritizedHash>,
    ut_transactions: HashMap<Hash, PrioritizedUnstakeTransaction>,
    sorted_ut_index: BTreeSet<PrioritizedHash>,
    // Minimum fee required to include a Stake Transaction into a block. We check for this fee in the
    // TransactionPool so we can choose not to insert a transaction we will not mine anyway.
    minimum_st_fee: u64,
    // Minimum fee required to include a Unstake Transaction into a block. We check for this fee in the
    // TransactionPool so we can choose not to insert a transaction we will not mine anyway.
    minimum_ut_fee: u64,
}

impl Default for TransactionsPool {
    fn default() -> Self {
        Self {
            vt_transactions: Default::default(),
            sorted_vt_index: Default::default(),
            dr_transactions: Default::default(),
            sorted_dr_index: Default::default(),
            co_hash_index: Default::default(),
            co_transactions: Default::default(),
            re_hash_index: Default::default(),
            re_transactions: Default::default(),
            output_pointer_map: Default::default(),
            total_vt_weight: 0,
            total_dr_weight: 0,
            total_st_weight: 0,
            total_ut_weight: 0,
            // Unlimited by default
            weight_limit: u64::MAX,
            // Try to keep the same amount of value transfer weight and data request weight
            vt_to_dr_factor: 1.0,
            // Default is to include all transactions into the pool and blocks
            minimum_vtt_fee: 0,
            // Default is to include all transactions into the pool and blocks
            minimum_st_fee: 0,
            // Default is to include all transactions into the pool and blocks
            minimum_ut_fee: 0,
            // Collateral minimum from consensus constants
            collateral_minimum: 0,
            // Required minimum reward to collateral percentage is defined as a consensus constant
            required_reward_collateral_ratio: u64::MAX,
            unconfirmed_transactions: Default::default(),
            st_transactions: Default::default(),
            sorted_st_index: Default::default(),
            ut_transactions: Default::default(),
            sorted_ut_index: Default::default(),
        }
    }
}

impl TransactionsPool {
    /// Makes a new empty pool of transactions.
    ///
    /// # Examples:
    ///
    /// ```
    /// # use witnet_data_structures::chain::TransactionsPool;
    /// let pool = TransactionsPool::new();
    /// ```
    pub fn new() -> Self {
        TransactionsPool::default()
    }

    /// Limit the total weight of the transactions that will be stored in the `TransactionsPool`.
    ///
    /// The sum of the weights of the transactions will always be below `weight_limit`.
    ///
    /// `vt_to_dr_factor` sets the preference between value transfer transactions and data request
    /// transactions. For example, a factor of 4.0 will try to keep 4/5 of the total weight in
    /// value transfer transactions, and the remaining 1/5 in data request transactions. Note that
    /// this ratio only applies when the `TransactionsPool` is full.
    pub fn set_total_weight_limit(
        &mut self,
        weight_limit: u64,
        vt_to_dr_factor: f64,
    ) -> Vec<Transaction> {
        self.weight_limit = weight_limit;
        self.vt_to_dr_factor = vt_to_dr_factor;
        // TODO: take into account stake tx
        self.remove_transactions_for_size_limit()
    }

    /// As a miner, require a minimum flat fee to include a VTT into the `TransactionsPool` and
    /// blocks.
    ///
    /// This fee is irrespective of the complexity of the VTT so this setting is as uncomplicated
    /// as possible.
    pub fn set_minimum_vtt_fee(&mut self, minimum_vtt_fee: u64) {
        self.minimum_vtt_fee = minimum_vtt_fee;
    }

    /// Set the collateral minimum from consensus constants
    pub fn set_collateral_minimum(&mut self, collateral_minimum: u64) {
        // The 20x factor accounts for the transitional collateral minimum enforced during the transition to 2.0
        self.collateral_minimum = 20 * collateral_minimum;
    }

    /// Set the required reward to collateral percentage (consensus constant) to include a data request
    /// into the `TransactionsPool` and blocks.
    pub fn set_required_reward_collateral_ratio(&mut self, required_reward_collateral_ratio: u64) {
        self.required_reward_collateral_ratio = required_reward_collateral_ratio;
    }

    /// Returns `true` if the pool contains no transactions.
    ///
    /// # Examples:
    ///
    /// ```
    /// # use witnet_data_structures::chain::TransactionsPool;
    /// let mut pool = TransactionsPool::new();
    ///
    /// assert!(pool.is_empty());
    /// ```
    pub fn is_empty(&self) -> bool {
        self.vt_transactions.is_empty()
            && self.dr_transactions.is_empty()
            && self.co_transactions.is_empty()
            && self.re_transactions.is_empty()
            && self.st_transactions.is_empty()
            && self.ut_transactions.is_empty()
    }

    /// Remove all the transactions but keep the allocated memory for reuse.
    pub fn clear(&mut self) {
        let TransactionsPool {
            vt_transactions,
            sorted_vt_index,
            dr_transactions,
            sorted_dr_index,
            co_hash_index,
            co_transactions,
            re_hash_index,
            re_transactions,
            output_pointer_map,
            total_vt_weight,
            total_dr_weight,
            total_st_weight,
            total_ut_weight,
            weight_limit: _,
            vt_to_dr_factor: _,
            minimum_vtt_fee: _,
            minimum_st_fee: _,
            minimum_ut_fee: _,
            collateral_minimum: _,
            required_reward_collateral_ratio: _,
            unconfirmed_transactions,
            st_transactions,
            sorted_st_index,
            ut_transactions,
            sorted_ut_index,
        } = self;

        vt_transactions.clear();
        sorted_vt_index.clear();
        dr_transactions.clear();
        sorted_dr_index.clear();
        co_hash_index.clear();
        co_transactions.clear();
        re_hash_index.clear();
        re_transactions.clear();
        output_pointer_map.clear();
        *total_vt_weight = 0;
        *total_dr_weight = 0;
        *total_st_weight = 0;
        *total_ut_weight = 0;
        unconfirmed_transactions.clear();
        st_transactions.clear();
        sorted_st_index.clear();
        ut_transactions.clear();
        sorted_ut_index.clear();
    }

    /// Returns the number of value transfer transactions in the pool.
    ///
    /// # Examples:
    ///
    /// ```
    /// # use witnet_data_structures::chain::{TransactionsPool, Hash};
    /// # use witnet_data_structures::transaction::{Transaction, VTTransaction};
    /// let mut pool = TransactionsPool::new();
    ///
    /// let transaction = Transaction::ValueTransfer(VTTransaction::default());
    ///
    /// assert_eq!(pool.vt_len(), 0);
    ///
    /// pool.insert(transaction, 0);
    ///
    /// assert_eq!(pool.vt_len(), 1);
    /// ```
    pub fn vt_len(&self) -> usize {
        self.vt_transactions.len()
    }

    /// Returns the number of data request transactions in the pool.
    ///
    /// # Examples:
    ///
    /// ```
    /// # use witnet_data_structures::chain::{TransactionsPool, Hash};
    /// # use witnet_data_structures::transaction::{Transaction, DRTransaction};
    /// let mut pool = TransactionsPool::new();
    ///
    /// let transaction = Transaction::DataRequest(DRTransaction::default());
    ///
    /// assert_eq!(pool.dr_len(), 0);
    ///
    /// pool.insert(transaction, 0);
    ///
    /// assert_eq!(pool.dr_len(), 1);
    /// ```
    pub fn dr_len(&self) -> usize {
        self.dr_transactions.len()
    }

    /// Returns the number of stake transactions in the pool.
    ///
    /// # Examples:
    ///
    /// ```
    /// # use witnet_data_structures::chain::{TransactionsPool, Hash};
    /// # use witnet_data_structures::transaction::{Transaction, StakeTransaction};
    /// let mut pool = TransactionsPool::new();
    ///
    /// let transaction = Transaction::Stake(StakeTransaction::default());
    ///
    /// assert_eq!(pool.st_len(), 0);
    ///
    /// pool.insert(transaction, 0);
    ///
    /// assert_eq!(pool.st_len(), 1);
    /// ```
    pub fn st_len(&self) -> usize {
        self.st_transactions.len()
    }

    /// Returns the number of unstake transactions in the pool.
    ///
    /// # Examples:
    ///
    /// ```
    /// # use witnet_data_structures::chain::{TransactionsPool, Hash};
    /// # use witnet_data_structures::transaction::{Transaction, StakeTransaction};
    /// let mut pool = TransactionsPool::new();
    ///
    /// let transaction = Transaction::Stake(StakeTransaction::default());
    ///
    /// assert_eq!(pool.st_len(), 0);
    ///
    /// pool.insert(transaction, 0);
    ///
    /// assert_eq!(pool.st_len(), 1);
    /// ```
    pub fn ut_len(&self) -> usize {
        self.ut_transactions.len()
    }

    /// Clear commit transactions in TransactionsPool
    pub fn clear_commits(&mut self) {
        self.co_transactions.clear();
        self.co_hash_index.clear();
    }

    /// Clear reveal transactions in TransactionsPool
    pub fn clear_reveals(&mut self) {
        self.re_transactions.clear();
        self.re_hash_index.clear();
    }

    /// Clear stake transactions in TransactionsPool
    pub fn clear_stake_transactions(&mut self) {
        self.st_transactions.clear();
        self.sorted_st_index.clear();
    }

    /// Clear unstake transactions in TransactionsPool
    pub fn clear_unstake_transactions(&mut self) {
        self.ut_transactions.clear();
        self.sorted_ut_index.clear();
    }

    /// Returns `Ok(true)` if the pool already contains this transaction.
    /// Returns an error if:
    /// * The transaction is of an invalid type (mint or tally)
    /// * The commit transaction has the same data request pointer and pkh as
    ///   an existing transaction, but different hash.
    /// * The reveal transaction has the same data request pointer and pkh as
    ///   an existing transaction, but different hash.
    pub fn contains(&self, transaction: &Transaction) -> Result<bool, TransactionError> {
        let tx_hash = transaction.hash();

        match transaction {
            Transaction::ValueTransfer(_vt) => Ok(self.vt_contains(&tx_hash)),
            Transaction::DataRequest(_drt) => Ok(self.dr_contains(&tx_hash)),
            Transaction::Commit(ct) => {
                let dr_pointer = ct.body.dr_pointer;
                let pkh = ct.body.proof.proof.pkh();

                self.commit_contains(&dr_pointer, &pkh, &tx_hash)
            }
            Transaction::Reveal(rt) => {
                let dr_pointer = rt.body.dr_pointer;
                let pkh = rt.body.pkh;

                self.reveal_contains(&dr_pointer, &pkh, &tx_hash)
            }
            // Tally and mint transaction only exist inside blocks, it should
            // be impossible for nodes to broadcast these kinds of transactions.
            Transaction::Tally(_tt) => Err(TransactionError::NotValidTransaction),
            Transaction::Mint(_mt) => Err(TransactionError::NotValidTransaction),
            Transaction::Stake(_st) => Ok(self.st_contains(&tx_hash)),
            Transaction::Unstake(_ut) => Ok(self.ut_contains(&tx_hash)),
        }
    }

    /// Returns `true` if the pool contains a value transfer
    /// transaction for the specified hash.
    ///
    /// The `key` may be any borrowed form of the hash, but `Hash` and
    /// `Eq` on the borrowed form must match those for the key type.
    ///
    /// # Examples:
    /// ```
    /// # use witnet_data_structures::chain::{TransactionsPool, Hash, Hashable};
    /// # use witnet_data_structures::transaction::{Transaction, VTTransaction};
    /// let mut pool = TransactionsPool::new();
    ///
    /// let transaction = Transaction::ValueTransfer(VTTransaction::default());
    /// let hash = transaction.hash();
    /// assert!(!pool.vt_contains(&hash));
    ///
    /// pool.insert(transaction, 0);
    ///
    /// assert!(pool.vt_contains(&hash));
    /// ```
    pub fn vt_contains(&self, key: &Hash) -> bool {
        self.vt_transactions.contains_key(key)
    }

    /// Returns `true` if the pool contains a data request
    /// transaction for the specified hash.
    ///
    /// The `key` may be any borrowed form of the hash, but `Hash` and
    /// `Eq` on the borrowed form must match those for the key type.
    pub fn dr_contains(&self, key: &Hash) -> bool {
        self.dr_transactions.contains_key(key)
    }

    /// Returns `Ok(true)` if the pool contains a commit transaction for the specified hash,
    /// data request pointer, and pkh. Return an error if the pool contains a commit transaction
    /// with the same data request pointer and pkh, but different hash.
    ///
    /// The `key` may be any borrowed form of the hash, but `Hash` and
    /// `Eq` on the borrowed form must match those for the key type.
    pub fn commit_contains(
        &self,
        dr_pointer: &Hash,
        pkh: &PublicKeyHash,
        tx_hash: &Hash,
    ) -> Result<bool, TransactionError> {
        self.co_transactions
            .get(dr_pointer)
            .and_then(|hm| hm.get(pkh))
            .map(|h| {
                if h == tx_hash {
                    Ok(true)
                } else {
                    Err(TransactionError::DuplicatedCommit {
                        pkh: *pkh,
                        dr_pointer: *dr_pointer,
                    })
                }
            })
            .unwrap_or(Ok(false))
    }

    /// Returns `Ok(true)` if the pool contains a reveal transaction for the specified hash,
    /// data request pointer, and pkh. Return an error if the pool contains a reveal transaction
    /// with the same data request pointer and pkh, but different hash.
    ///
    /// The `key` may be any borrowed form of the hash, but `Hash` and
    /// `Eq` on the borrowed form must match those for the key type.
    pub fn reveal_contains(
        &self,
        dr_pointer: &Hash,
        pkh: &PublicKeyHash,
        tx_hash: &Hash,
    ) -> Result<bool, TransactionError> {
        self.re_transactions
            .get(dr_pointer)
            .and_then(|hm| hm.get(pkh))
            .map(|h| {
                if h == tx_hash {
                    Ok(true)
                } else {
                    Err(TransactionError::DuplicatedReveal {
                        pkh: *pkh,
                        dr_pointer: *dr_pointer,
                    })
                }
            })
            .unwrap_or(Ok(false))
    }

    /// Returns `true` if the pool contains a stake transaction for the specified hash.
    ///
    /// The `key` may be any borrowed form of the hash, but `Hash` and
    /// `Eq` on the borrowed form must match those for the key type.
    ///
    /// # Examples:
    /// ```
    /// # use witnet_data_structures::chain::{TransactionsPool, Hash, Hashable};
    /// # use witnet_data_structures::transaction::{Transaction, StakeTransaction};
    /// let mut pool = TransactionsPool::new();
    ///
    /// let transaction = Transaction::Stake(StakeTransaction::default());
    /// let hash = transaction.hash();
    /// assert!(!pool.st_contains(&hash));
    ///
    /// pool.insert(transaction, 0);
    ///
    /// assert!(pool.st_contains(&hash));
    /// ```
    pub fn st_contains(&self, key: &Hash) -> bool {
        self.st_transactions.contains_key(key)
    }

    /// Returns `true` if the pool contains an unstake transaction for the
    /// specified hash.
    ///
    /// The `key` may be any borrowed form of the hash, but `Hash` and
    /// `Eq` on the borrowed form must match those for the key type.
    ///
    /// # Examples:
    /// ```
    /// # use witnet_data_structures::chain::{TransactionsPool, Hash, Hashable};
    /// # use witnet_data_structures::transaction::{Transaction, UnstakeTransaction};
    /// let mut pool = TransactionsPool::new();
    ///
    /// let transaction = Transaction::Unstake(UnstakeTransaction::default());
    /// let hash = transaction.hash();
    /// assert!(!pool.ut_contains(&hash));
    ///
    /// pool.insert(transaction, 0);
    ///
    /// assert!(pool.ut_contains(&hash));
    /// ```
    pub fn ut_contains(&self, key: &Hash) -> bool {
        self.ut_transactions.contains_key(key)
    }

    /// Remove a value transfer transaction from the pool and make sure that other transactions
    /// that may try to spend the same UTXOs are also removed.
    /// This should be used to remove transactions that got included in a consolidated block.
    ///
    /// Returns an `Option` with the value transfer transaction for the specified hash or `None` if not exist.
    ///
    /// The `key` may be any borrowed form of the hash, but `Hash` and
    /// `Eq` on the borrowed form must match those for the key type.
    ///
    /// # Examples:
    /// ```
    /// # use witnet_data_structures::chain::{TransactionsPool, Hash, Hashable};
    /// # use witnet_data_structures::transaction::{Transaction, VTTransaction};
    /// let mut pool = TransactionsPool::new();
    /// let vt_transaction = VTTransaction::default();
    /// let transaction = Transaction::ValueTransfer(vt_transaction.clone());
    /// pool.insert(transaction.clone(),0);
    ///
    /// assert!(pool.vt_contains(&transaction.hash()));
    ///
    /// let op_transaction_removed = pool.vt_remove(&vt_transaction);
    ///
    /// assert_eq!(Some(vt_transaction), op_transaction_removed);
    /// assert!(!pool.vt_contains(&transaction.hash()));
    /// ```
    pub fn vt_remove(&mut self, tx: &VTTransaction) -> Option<VTTransaction> {
        let key = tx.hash();
        let transaction = self.vt_remove_inner(&key, true);

        self.remove_inputs(&tx.body.inputs);

        transaction
    }

    /// After removing a transaction, remove the transaction hash from the output_pointer_map.
    /// This is not necessary if the transaction was removed because it is consolidated in a block.
    fn remove_tx_from_output_pointer_map(&mut self, key: &Hash, inputs: &[Input]) {
        for input in inputs {
            // It is possible for `get_mut` to return `None` if this transaction tries to spend the
            // same UTXO as an already consolidated transaction. In that case, the transaction has
            // already been removed, so no need to remove it again.
            if let Some(other_transactions_that_spend_this_input) =
                self.output_pointer_map.get_mut(&input.output_pointer)
            {
                let idx = other_transactions_that_spend_this_input
                    .iter()
                    .position(|x| x == key)
                    .expect("Invalid state in output_pointer_map");

                other_transactions_that_spend_this_input.swap_remove(idx);
                if other_transactions_that_spend_this_input.is_empty() {
                    self.output_pointer_map.remove(&input.output_pointer);
                }
            }
        }
    }

    /// Remove a value transfer transaction from the pool but do not remove other transactions that
    /// may try to spend the same UTXOs.
    /// This should be used to remove transactions that did not get included in a consolidated
    /// block.
    /// If the transaction did get included in a consolidated block, use `vt_remove` instead.
    fn vt_remove_inner(&mut self, key: &Hash, consolidated: bool) -> Option<VTTransaction> {
        self.vt_transactions
            .remove(key)
            .map(|(weight, transaction)| {
                self.sorted_vt_index.remove(&(weight, *key));
                self.total_vt_weight -= u64::from(transaction.weight());
                if !consolidated {
                    self.remove_tx_from_output_pointer_map(key, &transaction.body.inputs);
                }
                transaction
            })
    }

    /// Remove a data request transaction from the pool and make sure that other transactions
    /// that may try to spend the same UTXOs are also removed.
    /// This should be used to remove transactions that got included in a consolidated block.
    ///
    /// Returns an `Option` with the data request transaction for the specified hash or `None` if not exist.
    ///
    /// The `key` may be any borrowed form of the hash, but `Hash` and
    /// `Eq` on the borrowed form must match those for the key type.
    ///
    /// # Examples:
    /// ```
    /// # use witnet_data_structures::chain::{TransactionsPool, Hash, Hashable};
    /// # use witnet_data_structures::transaction::{Transaction, DRTransaction};
    /// let mut pool = TransactionsPool::new();
    /// let dr_transaction = DRTransaction::default();
    /// let transaction = Transaction::DataRequest(dr_transaction.clone());
    /// pool.insert(transaction.clone(),0);
    ///
    /// assert!(pool.dr_contains(&transaction.hash()));
    ///
    /// let op_transaction_removed = pool.dr_remove(&dr_transaction);
    ///
    /// assert_eq!(Some(dr_transaction), op_transaction_removed);
    /// assert!(!pool.dr_contains(&transaction.hash()));
    /// ```
    pub fn dr_remove(&mut self, tx: &DRTransaction) -> Option<DRTransaction> {
        let key = tx.hash();
        let transaction = self.dr_remove_inner(&key, true);

        self.remove_inputs(&tx.body.inputs);

        transaction
    }

    /// Remove a data request transaction from the pool but do not remove other transactions that
    /// may try to spend the same UTXOs.
    /// This should be used to remove transactions that did not get included in a consolidated
    /// block.
    /// If the transaction did get included in a consolidated block, use `dr_remove` instead.
    fn dr_remove_inner(&mut self, key: &Hash, consolidated: bool) -> Option<DRTransaction> {
        self.dr_transactions
            .remove(key)
            .map(|(weight, transaction)| {
                self.sorted_dr_index.remove(&(weight, *key));
                self.total_dr_weight -= u64::from(transaction.weight());
                if !consolidated {
                    self.remove_tx_from_output_pointer_map(key, &transaction.body.inputs);
                }
                transaction
            })
    }

    /// Remove all the transactions with the specified inputs
    pub fn remove_inputs(&mut self, inputs: &[Input]) {
        for input in inputs.iter() {
            if let Some(hashes) = self.output_pointer_map.remove(&input.output_pointer) {
                for hash in hashes.iter() {
                    self.vt_remove_inner(hash, false);
                    self.dr_remove_inner(hash, false);
                    self.st_remove_inner(hash, false);
                }
            }
        }
    }

    /// Returns a tuple with a vector of commit transactions that achieve the minimum specify
    /// by the data request, the value of all the fees obtained with those commits, and
    /// the list of data requests that have reached the commit limit
    pub fn remove_commits(
        &mut self,
        dr_pool: &DataRequestPool,
    ) -> (Vec<CommitTransaction>, u64, Vec<Hash>) {
        let mut total_fee = 0;
        let mut spent_inputs = HashSet::<Input>::new();
        let co_hash_index = &mut self.co_hash_index;
        let mut dr_pointer_vec = vec![];
        let commits_vector = self
            .co_transactions
            .iter_mut()
            // TODO: Decide with optimal capacity
            .fold(
                Vec::with_capacity(20),
                |mut commits_vec, (dr_pointer, commits)| {
                    if let Some(dr_output) = dr_pool.get_dr_output(dr_pointer) {
                        let n_commits = dr_output.witnesses as usize;

                        if commits.len() >= n_commits {
                            let filtered_commits: Vec<CommitTransaction> = commits
                                .drain()
                                .filter_map(|(_h, c)| {
                                    co_hash_index.remove(&c).and_then(|commit_tx| {
                                        let mut valid = true;
                                        let mut current_spent_inputs = HashSet::new();
                                        for input in commit_tx.body.collateral.iter() {
                                            // Check that no Input from this or any other commitment is being spent twice
                                            if spent_inputs.contains(input)
                                                || current_spent_inputs.contains(input)
                                            {
                                                valid = false;
                                                break;
                                            } else {
                                                current_spent_inputs.insert(input);
                                            }
                                        }
                                        // Only mark the inputs of this commitment as used if all of them
                                        // are valid and they will be returned by this function
                                        if valid {
                                            spent_inputs.extend(current_spent_inputs);
                                            Some(commit_tx)
                                        } else {
                                            None
                                        }
                                    })
                                })
                                .take(n_commits)
                                .collect();

                            // Check once again that after filtering invalid commitments, we still have as many as requested
                            if filtered_commits.len() == n_commits {
                                commits_vec.extend(filtered_commits);
                                total_fee += dr_output.commit_and_reveal_fee * n_commits as u64;
                                dr_pointer_vec.push(*dr_pointer);
                            }
                        }
                    }
                    commits_vec
                },
            );

        // Clear commit hash index: commits are invalidated at the end of the epoch
        self.clear_commits();

        (commits_vector, total_fee, dr_pointer_vec)
    }

    /// Remove a stake transaction from the pool and make sure that other transactions
    /// that may try to spend the same UTXOs are also removed.
    /// This should be used to remove transactions that got included in a consolidated block.
    ///
    /// Returns an `Option` with the stake transaction for the specified hash or `None` if not exist.
    ///
    /// The `key` may be any borrowed form of the hash, but `Hash` and
    /// `Eq` on the borrowed form must match those for the key type.
    ///
    /// # Examples:
    /// ```
    /// # use witnet_data_structures::chain::{TransactionsPool, Hash, Hashable};
    /// # use witnet_data_structures::transaction::{Transaction, StakeTransaction};
    /// let mut pool = TransactionsPool::new();
    /// let st_transaction = StakeTransaction::default();
    /// let transaction = Transaction::Stake(st_transaction.clone());
    /// pool.insert(transaction.clone(),0);
    ///
    /// assert!(pool.st_contains(&transaction.hash()));
    ///
    /// let op_transaction_removed = pool.st_remove(&st_transaction);
    ///
    /// assert_eq!(Some(st_transaction), op_transaction_removed);
    /// assert!(!pool.st_contains(&transaction.hash()));
    /// ```
    pub fn st_remove(&mut self, tx: &StakeTransaction) -> Option<StakeTransaction> {
        let key = tx.hash();
        let transaction = self.st_remove_inner(&key, true);

        self.remove_inputs(&tx.body.inputs);

        transaction
    }

    /// Remove a stake from the pool but do not remove other transactions that may try to spend the
    /// same UTXOs.
    /// This should be used to remove transactions that did not get included in a consolidated
    /// block.
    /// If the transaction did get included in a consolidated block, use `st_remove` instead.
    fn st_remove_inner(&mut self, key: &Hash, consolidated: bool) -> Option<StakeTransaction> {
        self.st_transactions
            .remove(key)
            .map(|(weight, transaction)| {
                self.sorted_st_index.remove(&(weight, *key));
                self.total_st_weight -= u64::from(transaction.weight());
                if !consolidated {
                    self.remove_tx_from_output_pointer_map(key, &transaction.body.inputs);
                }
                transaction
            })
    }

    /// Remove stake transactions that would result in overstaking on a validator
    pub fn remove_invalid_stake_transactions(&mut self, transactions: Vec<Hash>) {
        for st_tx_hash in transactions.iter() {
            if let Some(st_tx) = self
                .st_transactions
                .get(st_tx_hash)
                .map(|(_, st)| st.clone())
            {
                self.st_remove(&st_tx);
            }
        }
    }

    /// Remove unstake transactions that violate one or more of the unstaking rules
    pub fn remove_invalid_unstake_transactions(&mut self, transactions: Vec<Hash>) {
        for ut_tx_hash in transactions.iter() {
            if let Some(ut_tx) = self
                .ut_transactions
                .get(ut_tx_hash)
                .map(|(_, ut)| ut.clone())
            {
                self.ut_remove(&ut_tx);
            }
        }
    }

    /// Remove an unstake transaction from the pool.
    ///
    /// This should be used to remove transactions that got included in a consolidated block.
    ///
    /// Returns an `Option` with the stake transaction for the specified hash or `None` if not exist.
    ///
    /// The `key` may be any borrowed form of the hash, but `Hash` and
    /// `Eq` on the borrowed form must match those for the key type.
    ///
    pub fn ut_remove(&mut self, tx: &UnstakeTransaction) -> Option<UnstakeTransaction> {
        self.ut_remove_inner(&tx.hash())
    }

    /// Remove an unstake transaction from the pool but do not remove other transactions that
    /// may try to spend the same UTXOs, because this kind of transactions spend no UTXOs.
    /// This should be used to remove transactions that did not get included in a consolidated
    /// block.
    fn ut_remove_inner(&mut self, key: &Hash) -> Option<UnstakeTransaction> {
        self.ut_transactions
            .remove(key)
            .map(|(weight, transaction)| {
                self.sorted_ut_index.remove(&(weight, *key));
                self.total_ut_weight -= u64::from(transaction.weight());

                transaction
            })
    }

    /// Returns a tuple with a vector of reveal transactions and the value
    /// of all the fees obtained with those reveals
    pub fn get_reveals(&self, dr_pool: &DataRequestPool) -> (Vec<&RevealTransaction>, u64) {
        let mut total_fee = 0;
        let re_hash_index = &self.re_hash_index;
        let reveals_vector = self
            .re_transactions
            .iter()
            // TODO: Decide with optimal capacity
            .fold(
                Vec::with_capacity(20),
                |mut reveals_vec, (dr_pointer, reveals)| {
                    if let Some(dr_output) = dr_pool.get_dr_output(dr_pointer) {
                        let n_reveals = reveals.len();
                        reveals_vec
                            .extend(reveals.iter().map(|(_h, r)| re_hash_index.get(r).unwrap()));

                        total_fee += dr_output.commit_and_reveal_fee * n_reveals as u64;
                    }

                    reveals_vec
                },
            );

        (reveals_vector, total_fee)
    }

    /// Remove one reveal that was included in a consolidated block. This is used to avoid inserting
    /// duplicate reveals when mining blocks.
    // The removed reveals cannot be inserted to the transactions pool again because they are invalid:
    // validate_reveal_transaction returns DuplicatedReveal
    pub fn remove_one_reveal(
        &mut self,
        data_request_hash: &Hash,
        reveal_pkh: &PublicKeyHash,
        re_tx_hash: &Hash,
    ) -> Option<RevealTransaction> {
        if let Some(re_tx) = self.re_hash_index.remove(re_tx_hash) {
            let reveals = self.re_transactions.get_mut(data_request_hash).unwrap();
            reveals.remove(reveal_pkh);
            if reveals.is_empty() {
                self.re_transactions.remove(data_request_hash);
            }

            Some(re_tx)
        } else {
            None
        }
    }

    /// Remove all the remaining reveals for this data request, because it is already in tally stage
    /// and does not accept any more reveals. Ideally all the reveals have been included in a
    /// previous block and this method does nothing, but if the data request finished with some
    /// missing reveals then they need to be cleared.
    pub fn clear_reveals_from_finished_dr(&mut self, data_request_hash: &Hash) {
        if let Some(reveals) = self.re_transactions.remove(data_request_hash) {
            for re_tx_hash in reveals.values() {
                self.re_hash_index.remove(re_tx_hash);
            }
        }
    }

    /// Remove transactions until the size limit is satisfied.
    /// Returns a list of all the removed transactions.
    fn remove_transactions_for_size_limit(&mut self) -> Vec<Transaction> {
        let mut removed_transactions = vec![];
        while self.total_transactions_weight() > self.weight_limit {
            // Try to split the memory between value transfer and data requests using the same
            // ratio as the one used in blocks
            // The ratio of vt to dr in blocks is currently 1:4
            // TODO: What the criteria to delete st? It should be 1:8
            #[allow(clippy::cast_precision_loss)]
            let more_vtts_than_drs =
                self.total_vt_weight as f64 >= self.total_dr_weight as f64 * self.vt_to_dr_factor;
            if more_vtts_than_drs {
                // Remove the value transfer transaction with the lowest fee/weight
                let tx_hash = self
                    .sorted_vt_index
                    .iter()
                    .map(|(_fee_weight, tx_hash)| *tx_hash)
                    .next()
                    // There must be at least one transaction because the total weight is not zero
                    .unwrap();
                let tx = self.vt_remove_inner(&tx_hash, false).unwrap();
                removed_transactions.push(Transaction::ValueTransfer(tx));
            } else {
                // Remove the data request transaction with the lowest fee/weight
                let tx_hash = self
                    .sorted_dr_index
                    .iter()
                    .map(|(_fee_weight, tx_hash)| *tx_hash)
                    .next()
                    // There must be at least one transaction because the total weight is not zero
                    .unwrap();
                let tx = self.dr_remove_inner(&tx_hash, false).unwrap();
                removed_transactions.push(Transaction::DataRequest(tx));
            }
        }

        removed_transactions
    }

    /// Insert a transaction identified by `key` into the pool.
    ///
    /// Due to the size limit, inserting a new transaction may result in some older ones being
    /// removed. This method returns a list of the removed transactions.
    ///
    /// If the transaction is not added due to configurable constraints, the method returns a
    /// list containing only the transaction that was not added
    ///
    /// # Examples:
    ///
    /// ```
    /// # use witnet_data_structures::chain::{TransactionsPool, Hash};
    /// # use witnet_data_structures::transaction::{Transaction, VTTransaction};
    /// let mut pool = TransactionsPool::new();
    /// let transaction = Transaction::ValueTransfer(VTTransaction::default());
    /// pool.insert(transaction, 0);
    ///
    /// assert!(!pool.is_empty());
    /// ```
    #[allow(clippy::cast_precision_loss)]
    pub fn insert(&mut self, transaction: Transaction, fee: u64) -> Vec<Transaction> {
        let key = transaction.hash();

        match transaction {
            Transaction::ValueTransfer(vt_tx) => {
                let weight = f64::from(vt_tx.weight());
                let priority = OrderedFloat(fee as f64 / weight);

                if fee < self.minimum_vtt_fee {
                    return vec![Transaction::ValueTransfer(vt_tx)];
                } else {
                    self.total_vt_weight += u64::from(vt_tx.weight());

                    for input in &vt_tx.body.inputs {
                        self.output_pointer_map
                            .entry(input.output_pointer)
                            .or_default()
                            .push(vt_tx.hash());
                    }

                    self.vt_transactions.insert(key, (priority, vt_tx));
                    self.sorted_vt_index.insert((priority, key));
                }
            }
            Transaction::DataRequest(dr_tx) => {
                let dr_tx_reward_collateral_ratio = calculate_reward_collateral_ratio(
                    self.collateral_minimum,
                    dr_tx.body.dr_output.collateral,
                    dr_tx.body.dr_output.witness_reward,
                );
                if dr_tx_reward_collateral_ratio > self.required_reward_collateral_ratio {
                    return vec![Transaction::DataRequest(dr_tx)];
                } else {
                    let weight = f64::from(dr_tx.weight());
                    let priority = OrderedFloat(fee as f64 / weight);

                    self.total_dr_weight += u64::from(dr_tx.weight());

                    for input in &dr_tx.body.inputs {
                        self.output_pointer_map
                            .entry(input.output_pointer)
                            .or_default()
                            .push(dr_tx.hash());
                    }

                    self.dr_transactions.insert(key, (priority, dr_tx));
                    self.sorted_dr_index.insert((priority, key));
                }
            }
            Transaction::Commit(co_tx) => {
                let dr_pointer = co_tx.body.dr_pointer;
                let pkh = PublicKeyHash::from_public_key(&co_tx.signatures[0].public_key);
                let tx_hash = co_tx.hash();

                self.co_hash_index.insert(tx_hash, co_tx);
                self.co_transactions
                    .entry(dr_pointer)
                    .or_default()
                    .insert(pkh, tx_hash);
            }
            Transaction::Reveal(re_tx) => {
                let dr_pointer = re_tx.body.dr_pointer;
                let pkh = re_tx.body.pkh;
                let tx_hash = re_tx.hash();

                self.re_hash_index.insert(tx_hash, re_tx);
                self.re_transactions
                    .entry(dr_pointer)
                    .or_default()
                    .insert(pkh, tx_hash);
            }
            Transaction::Stake(st_tx) => {
                let weight = f64::from(st_tx.weight());
                let priority = OrderedFloat(fee as f64 / weight);

                if fee < self.minimum_st_fee {
                    return vec![Transaction::Stake(st_tx)];
                } else {
                    self.total_st_weight += u64::from(st_tx.weight());

                    for input in &st_tx.body.inputs {
                        self.output_pointer_map
                            .entry(input.output_pointer)
                            .or_default()
                            .push(st_tx.hash());
                    }

                    self.st_transactions.insert(key, (priority, st_tx));
                    self.sorted_st_index.insert((priority, key));
                }
            }
            Transaction::Unstake(ut_tx) => {
                let weight = f64::from(ut_tx.weight());
                let priority = OrderedFloat(fee as f64 / weight);

                if fee < self.minimum_ut_fee {
                    return vec![Transaction::Unstake(ut_tx)];
                } else {
                    self.total_ut_weight += u64::from(ut_tx.weight());

                    self.ut_transactions.insert(key, (priority, ut_tx));
                    self.sorted_ut_index.insert((priority, key));
                }
            }
            tx => {
                panic!(
                    "Transaction kind not supported by TransactionsPool: {:?}",
                    tx
                );
            }
        }

        self.remove_transactions_for_size_limit()
    }

    /// An iterator visiting all the value transfer transactions
    /// in the pool in descending-fee order, that is, transactions
    /// with bigger fees come first.
    ///
    /// Examples:
    ///
    /// ```
    /// # use witnet_data_structures::chain::{TransactionsPool, Hash};
    /// # use witnet_data_structures::transaction::{Transaction, VTTransaction};
    /// let mut pool = TransactionsPool::new();
    ///
    /// let transaction = Transaction::ValueTransfer(VTTransaction::default());
    ///
    /// pool.insert(transaction.clone(),0);
    /// pool.insert(transaction, 0);
    ///
    /// let mut iter = pool.vt_iter();
    /// let tx1 = iter.next();
    /// let tx2 = iter.next();
    ///
    /// ```
    pub fn vt_iter(&self) -> impl Iterator<Item = &VTTransaction> {
        self.sorted_vt_index
            .iter()
            .rev()
            .filter_map(move |(_, h)| self.vt_transactions.get(h).map(|(_, t)| t))
    }

    /// An iterator visiting all the data request transactions
    /// in the pool
    pub fn dr_iter(&self) -> impl Iterator<Item = &DRTransaction> {
        self.sorted_dr_index
            .iter()
            .rev()
            .filter_map(move |(_, h)| self.dr_transactions.get(h).map(|(_, t)| t))
    }

    /// An iterator visiting all the stake transactions
    /// in the pool
    pub fn st_iter(&self) -> impl Iterator<Item = &StakeTransaction> {
        self.sorted_st_index
            .iter()
            .rev()
            .filter_map(move |(_, h)| self.st_transactions.get(h).map(|(_, t)| t))
    }

    /// An iterator visiting all the unstake transactions
    /// in the pool
    pub fn ut_iter(&self) -> impl Iterator<Item = &UnstakeTransaction> {
        self.sorted_ut_index
            .iter()
            .rev()
            .filter_map(move |(_, h)| self.ut_transactions.get(h).map(|(_, t)| t))
    }

    /// Returns a reference to the value corresponding to the key.
    ///
    /// Examples:
    ///
    /// ```
    /// # use witnet_data_structures::chain::{TransactionsPool, Hash, Hashable};
    /// # use witnet_data_structures::transaction::{Transaction, VTTransaction};
    /// let mut pool = TransactionsPool::new();
    ///
    /// let transaction = Transaction::ValueTransfer(VTTransaction::default());
    /// let hash = transaction.hash();
    ///
    /// assert!(pool.vt_get(&hash).is_none());
    ///
    /// pool.insert(transaction, 0);
    ///
    /// assert!(pool.vt_get(&hash).is_some());
    /// ```
    // TODO: dead code
    pub fn vt_get(&self, key: &Hash) -> Option<&VTTransaction> {
        self.vt_transactions
            .get(key)
            .map(|(_, transaction)| transaction)
    }

    /// Retains only the elements specified by the predicate.
    ///
    /// In other words, remove all transactions such that
    /// `f(&Hash, &Transaction)` returns `false`.
    ///
    /// # Examples
    ///
    /// ```
    /// # use witnet_data_structures::chain::{TransactionsPool, Hash, ValueTransferOutput};
    /// # use witnet_data_structures::transaction::{Transaction, VTTransaction, VTTransactionBody};
    /// use witnet_data_structures::transaction::Transaction::ValueTransfer;
    ///
    /// let mut pool = TransactionsPool::new();
    ///
    /// let transaction1 = Transaction::ValueTransfer(VTTransaction::default());
    /// let transaction2 = Transaction::ValueTransfer(VTTransaction::new(VTTransactionBody::new(vec![], vec![ValueTransferOutput {
    /// value:3,
    /// ..ValueTransferOutput::default()
    /// }]),
    /// vec![]));
    ///
    /// pool.insert(transaction1,0);
    /// pool.insert(transaction2,0);
    /// assert_eq!(pool.vt_len(), 2);
    /// pool.vt_retain(|tx| tx.body.outputs.len()>0);
    /// assert_eq!(pool.vt_len(), 1);
    /// ```
    // TODO: dead code
    pub fn vt_retain<F>(&mut self, mut f: F)
    where
        F: FnMut(&VTTransaction) -> bool,
    {
        let TransactionsPool {
            ref mut vt_transactions,
            sorted_vt_index: ref mut sorted_index,
            ref mut total_vt_weight,
            ..
        } = *self;

        vt_transactions.retain(|hash, (weight, vt_transaction)| {
            let retain = f(vt_transaction);
            if !retain {
                *total_vt_weight -= 1;
                sorted_index.remove(&(*weight, *hash));
            }

            retain
        });
    }

    /// Get transaction by hash
    pub fn get(&self, hash: &Hash) -> Option<Transaction> {
        self.vt_transactions
            .get(hash)
            .map(|(_, vtt)| Transaction::ValueTransfer(vtt.clone()))
            .or_else(|| {
                self.dr_transactions
                    .get(hash)
                    .map(|(_, drt)| Transaction::DataRequest(drt.clone()))
            })
            .or_else(|| {
                self.co_hash_index
                    .get(hash)
                    .map(|ct| Transaction::Commit(ct.clone()))
            })
            .or_else(|| {
                self.re_hash_index
                    .get(hash)
                    .map(|rt| Transaction::Reveal(rt.clone()))
            })
            .or_else(|| {
                self.st_transactions
                    .get(hash)
                    .map(|(_, st)| Transaction::Stake(st.clone()))
            })
            .or_else(|| {
                self.ut_transactions
                    .get(hash)
                    .map(|(_, ut)| Transaction::Unstake(ut.clone()))
            })
    }

    /// Update unconfirmed transactions
    pub fn update_unconfirmed_transactions(&mut self) {
        self.unconfirmed_transactions.update();
    }

    pub fn insert_unconfirmed_transactions(&mut self, h: Hash) {
        self.unconfirmed_transactions.insert(h);
    }

    pub fn remove_unconfirmed_transactions(&mut self) -> Vec<Transaction> {
        let unconfirmed_hashes = self.unconfirmed_transactions.remove_all();

        let mut v = vec![];
        for hash in unconfirmed_hashes {
            if let Some(transaction) = self.get(&hash) {
                match transaction {
                    Transaction::ValueTransfer(_) => {
                        let _x = self.vt_remove_inner(&hash, false);
                    }
                    Transaction::DataRequest(_) => {
                        let _x = self.dr_remove_inner(&hash, false);
                    }
                    Transaction::Stake(_) => {
                        let _x = self.st_remove_inner(&hash, false);
                    }
                    Transaction::Unstake(_) => {
                        let _x = self.ut_remove_inner(&hash);
                    }
                    _ => continue,
                }

                v.push(transaction);
            }
        }

        // Clear commits and reveals
        self.clear_commits();
        self.clear_reveals();

        v
    }

    pub fn total_transactions_weight(&self) -> u64 {
        self.total_vt_weight + self.total_dr_weight + self.total_st_weight
    }
}

/// Unspent output data structure (equivalent of Bitcoin's UTXO)
/// It is used to locate the output by its transaction identifier and its position
#[derive(Default, Hash, Copy, Clone, Eq, PartialEq, ProtobufConvert)]
#[protobuf_convert(pb = "crate::proto::schema::witnet::OutputPointer")]
pub struct OutputPointer {
    /// Transaction identifier
    pub transaction_id: Hash,
    /// Index of output inside transaction
    pub output_index: u32,
}

impl fmt::Display for OutputPointer {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        f.write_str(&format!("{}:{}", &self.transaction_id, &self.output_index))
    }
}

impl fmt::Debug for OutputPointer {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        write!(f, "{}", self)
    }
}

impl FromStr for OutputPointer {
    type Err = OutputPointerParseError;
    fn from_str(s: &str) -> Result<Self, Self::Err> {
        if !s.trim().contains(':') {
            return Err(OutputPointerParseError::MissingColon);
        }

        let mut tokens = s.trim().split(':');

        let transaction_id = tokens
            .next()
            .ok_or(OutputPointerParseError::Hash(
                HashParseError::InvalidLength(0),
            ))?
            .parse()
            .map_err(OutputPointerParseError::Hash)?;
        let output_index = tokens
            .next()
            .ok_or(OutputPointerParseError::MissingColon)?
            .parse::<u32>()
            .map_err(OutputPointerParseError::ParseIntError)?;

        Ok(OutputPointer {
            transaction_id,
            output_index,
        })
    }
}

impl Ord for OutputPointer {
    fn cmp(&self, other: &Self) -> Ordering {
        (self.transaction_id, self.output_index).cmp(&(other.transaction_id, other.output_index))
    }
}

impl PartialOrd for OutputPointer {
    fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
        Some(self.cmp(other))
    }
}

/// Inventory entry data structure
#[derive(Debug, Eq, PartialEq, Clone, Serialize, Deserialize, ProtobufConvert)]
#[protobuf_convert(pb = "crate::proto::schema::witnet::InventoryEntry")]
pub enum InventoryEntry {
    /// Transaction
    Tx(Hash),
    /// Block
    Block(Hash),
    SuperBlock(u32),
}

/// Pointer to transaction inside block.
/// Composed of transaction type and index
#[derive(Debug, Eq, PartialEq, Copy, Clone, Serialize, Deserialize)]
pub enum TransactionPointer {
    /// Value transfer
    ValueTransfer(u32),
    /// Data request
    DataRequest(u32),
    /// Commit
    Commit(u32),
    /// Reveal
    Reveal(u32),
    /// Tally
    Tally(u32),
    /// Mint
    Mint,
    // Stake
    Stake(u32),
    // Unstake
    Unstake(u32),
}

/// This is how transactions are stored in the database: hash of the containing block, plus index
#[derive(Debug, Eq, PartialEq, Clone, Serialize, Deserialize)]
pub struct PointerToBlock {
    /// Hash of the block that contains the transaction
    pub block_hash: Hash,
    /// Index of the transaction inside that block
    pub transaction_index: TransactionPointer,
}

/// Inventory element: block, txns
#[derive(Debug, Eq, PartialEq, Clone, Serialize, Deserialize)]
#[allow(clippy::large_enum_variant)]
pub enum InventoryItem {
    /// Transaction
    #[serde(rename = "transaction")]
    Transaction(Transaction),
    /// Block
    #[serde(rename = "block")]
    Block(Block),
    #[serde(rename = "superBlock")]
    SuperBlock(SuperBlock),
}

/// List of outputs related to a data request
#[derive(Clone, Debug, Eq, PartialEq, Serialize, Deserialize)]
pub struct DataRequestInfo {
    /// List of commitments to resolve the data request
    pub commits: HashMap<PublicKeyHash, CommitTransaction>,
    /// List of reveals to the commitments (contains the data request witnet result)
    pub reveals: HashMap<PublicKeyHash, RevealTransaction>,
    /// Tally of data request (contains final result)
    pub tally: Option<TallyTransaction>,
    /// Hash of the block with the DataRequestTransaction
    pub block_hash_dr_tx: Option<Hash>,
    /// Hash of the block with the TallyTransaction
    pub block_hash_tally_tx: Option<Hash>,
    /// Current commit round
    pub current_commit_round: u16,
    /// Current reveal round
    pub current_reveal_round: u16,
    /// Current stage, or None if finished
    pub current_stage: Option<DataRequestStage>,
}

impl Default for DataRequestInfo {
    fn default() -> Self {
        Self {
            commits: Default::default(),
            reveals: Default::default(),
            tally: None,
            block_hash_dr_tx: None,
            block_hash_tally_tx: None,
            current_commit_round: 0,
            current_reveal_round: 0,
            current_stage: Some(DataRequestStage::COMMIT),
        }
    }
}

/// State of data requests in progress (stored in memory)
#[derive(Clone, Debug, Eq, PartialEq, Serialize, Deserialize, Default)]
pub struct DataRequestState {
    /// Data request output (contains all required information to process it)
    pub data_request: DataRequestOutput,
    /// PublicKeyHash of the data request creator
    pub pkh: PublicKeyHash,
    /// List of outputs related to this data request
    pub info: DataRequestInfo,
    /// Current stage of this data request
    pub stage: DataRequestStage,
    /// The epoch on which this data request has been or will be unlocked
    // (necessary for removing from the data_requests_by_epoch map)
    pub epoch: Epoch,
}

impl DataRequestState {
    /// Add a new data request state
    pub fn new(
        data_request: DataRequestOutput,
        pkh: PublicKeyHash,
        epoch: Epoch,
        block_hash_dr_tx: Option<Hash>,
    ) -> Self {
        let stage = DataRequestStage::COMMIT;
        let mut info = DataRequestInfo {
            ..DataRequestInfo::default()
        };
        info.block_hash_dr_tx = block_hash_dr_tx;
        info.current_stage = Some(stage);

        Self {
            data_request,
            pkh,
            info,
            stage,
            epoch,
        }
    }

    /// Add commit
    pub fn add_commit(
        &mut self,
        pkh: PublicKeyHash,
        commit: CommitTransaction,
    ) -> Result<(), failure::Error> {
        if let DataRequestStage::COMMIT = self.stage {
            self.info.commits.insert(pkh, commit);

            Ok(())
        } else {
            Err(DataRequestError::NotCommitStage.into())
        }
    }

    /// Add reveal
    pub fn add_reveal(
        &mut self,
        pkh: PublicKeyHash,
        reveal: RevealTransaction,
    ) -> Result<(), failure::Error> {
        if let DataRequestStage::REVEAL = self.stage {
            self.info.reveals.insert(pkh, reveal);

            Ok(())
        } else {
            Err(DataRequestError::NotRevealStage.into())
        }
    }

    /// Add tally and return the data request report
    pub fn add_tally(
        mut self,
        tally: TallyTransaction,
        block_hash_tally_tx: &Hash,
    ) -> Result<DataRequestInfo, failure::Error> {
        if let DataRequestStage::TALLY = self.stage {
            self.info.tally = Some(tally);
            self.info.block_hash_tally_tx = Some(*block_hash_tally_tx);
            self.info.current_stage = None;

            Ok(self.info)
        } else {
            Err(DataRequestError::NotTallyStage.into())
        }
    }

    /// Advance to the next stage.
    /// Since the data requests are updated by looking at the transactions from a valid block,
    /// the only issue would be that there were no commits in that block.
    pub fn update_stage(&mut self, extra_rounds: u16, too_many_witnesses: bool) {
        self.stage = match self.stage {
            DataRequestStage::COMMIT => {
                if self.info.commits.is_empty() {
                    if too_many_witnesses {
                        DataRequestStage::TALLY
                    } else if self.info.current_commit_round <= extra_rounds {
                        self.info.current_commit_round += 1;
                        DataRequestStage::COMMIT
                    } else {
                        DataRequestStage::TALLY
                    }
                } else {
                    self.info.current_reveal_round = 1;
                    DataRequestStage::REVEAL
                }
            }
            DataRequestStage::REVEAL => {
                if self.info.reveals.len() < self.data_request.witnesses as usize
                    && self.info.current_reveal_round <= extra_rounds
                {
                    self.info.current_reveal_round += 1;
                    DataRequestStage::REVEAL
                } else {
                    DataRequestStage::TALLY
                }
            }
            DataRequestStage::TALLY => {
                if self.info.tally.is_none() {
                    DataRequestStage::TALLY
                } else {
                    panic!("Data request in tally stage should have been removed from the pool");
                }
            }
        };
        self.info.current_stage = Some(self.stage);
    }

    /// Function to set the stage in case we forced it to advance during validations
    pub fn set_stage(&mut self, stage: DataRequestStage) {
        self.stage = stage;
        self.info.current_stage = Some(self.stage);
    }

    /// Function to calculate the backup witnesses required
    pub fn backup_witnesses(&self) -> u16 {
        calculate_backup_witnesses(self.data_request.witnesses, self.info.current_commit_round)
    }
}

/// Calculate the number of backup witnesses that will be added to the number of witnesses depending
/// on the current commit round. The first commit round is 1 (not 0) and there are as many
/// additional rounds as the extra_rounds value from consensus constants.
pub fn calculate_backup_witnesses(witnesses: u16, commit_round: u16) -> u16 {
    let exponent = u32::from(commit_round).saturating_sub(1);
    let coefficient = 2_u16.saturating_pow(exponent);

    witnesses.saturating_mul(coefficient) / 2
}

/// Data request current stage
#[derive(Copy, Clone, Debug, Default, Eq, PartialEq, Serialize, Deserialize)]
pub enum DataRequestStage {
    /// Expecting commitments for data request
    #[default]
    COMMIT,
    /// Expecting reveals to previously published commitments
    REVEAL,
    /// Expecting tally to be included in block
    TALLY,
}

pub type Blockchain = BTreeMap<Epoch, Hash>;

/// Node stats
#[derive(Debug, Default, Clone, Serialize, Deserialize, PartialEq, Eq)]
pub struct NodeStats {
    /// Number of proposed blocks
    pub block_proposed_count: u32,
    /// Number of blocks included in the block chain
    pub block_mined_count: u32,
    /// Number of times we were eligible to participate in a Data Request
    pub dr_eligibility_count: u32,
    /// Number of proposed commits
    pub commits_proposed_count: u32,
    /// Number of commits included in a data request
    pub commits_count: u32,
    /// Last block proposed
    pub last_block_proposed: Hash,
    /// Number of slashed commits
    pub slashed_count: u32,
}

/// Blockchain state (valid at a certain epoch)
#[derive(Debug, Default, Clone, Serialize, Deserialize, PartialEq)]
pub struct ChainState {
    /// Blockchain information data structure
    pub chain_info: Option<ChainInfo>,
    /// Unspent Outputs Pool
    pub unspent_outputs_pool_old_migration_db: OldUnspentOutputsPool,
    /// Collection of state structures for active data requests
    pub data_request_pool: DataRequestPool,
    /// List of consolidated blocks by epoch
    pub block_chain: Blockchain,
    /// List of unspent outputs that can be spent by this node
    /// Those UTXOs have a timestamp value to avoid double spending
    pub own_utxos: OwnUnspentOutputsPool,
    /// Reputation engine
    pub reputation_engine: Option<ReputationEngine>,
    /// Node mining stats
    pub node_stats: NodeStats,
    /// Alternative public key mapping
    pub alt_keys: AltKeys,
    /// Current superblock state
    pub superblock_state: SuperBlockState,
    /// TAPI Engine
    pub tapi_engine: TapiEngine,
    /// Tracks stakes for every validator in the network
    #[serde(default)]
    pub stakes: Stakes<WIT_DECIMAL_PLACES, PublicKeyHash, Wit, Epoch, u64, u64>,
    /// Unspent Outputs Pool
    #[serde(skip)]
    pub unspent_outputs_pool: UnspentOutputsPool,
}

impl ChainState {
    /// Return the number of consolidated blocks
    pub fn block_number(&self) -> u32 {
        u32::try_from(self.block_chain.len()).unwrap()
    }

    /// Return the hash and epoch number of the last consolidated block
    pub fn get_chain_beacon(&self) -> CheckpointBeacon {
        self.chain_info
            .as_ref()
            .expect("ChainInfo is None")
            .highest_block_checkpoint
    }

    /// Return the hash and index of the last superblock with a majority of votes
    pub fn get_superblock_beacon(&self) -> CheckpointBeacon {
        self.chain_info
            .as_ref()
            .expect("ChainInfo is None")
            .highest_superblock_checkpoint
    }

    /// Return a copy of the consensus constants defined for the current network
    pub fn get_consensus_constants(&self) -> ConsensusConstants {
        self.chain_info
            .as_ref()
            .expect("ChainInfo is None")
            .consensus_constants
            .clone()
    }
}

/// A boxed and pinned future that resolves to a vector of stuff.
type CollectionGenerator<T, E> = BoxFuture<'static, Result<Vec<T>, E>>;

/// Unifies a future of `ChainState` with promises for whatever other data structures that are
/// needed for chain state portability, i.e., copying the whole blockchain from one node to another.
pub struct ChainImport<E>
where
    E: std::error::Error,
{
    /// The full history of blocks, accumulated in batches.
    pub blocks: Result<Vec<CollectionGenerator<Block, E>>, E>,
    /// The chain state itself.
    pub chain_state: BoxFuture<'static, Result<ChainState, E>>,
    /// The full history of superblocks.
    pub superblocks: CollectionGenerator<SuperBlock, E>,
}

/// Alternative public key mapping: maps each secp256k1 public key hash to
/// different public keys in other curves
#[derive(Clone, Debug, Default, Deserialize, Eq, PartialEq, Serialize)]
pub struct AltKeys {
    /// BN256 curve
    bn256: HashMap<PublicKeyHash, Bn256PublicKey>,
}

impl AltKeys {
    /// Get the associated BN256 public key for a given identity
    pub fn get_bn256(&self, k: &PublicKeyHash) -> Option<&Bn256PublicKey> {
        self.bn256.get(k)
    }
    /// Insert a new BN256 public key, if valid,  for a given identity. If the identity
    /// already had an associated BN256 public key, it will be overwritten.
    /// Returns the old BN256 public key for this identity, if any
    pub fn insert_bn256(&mut self, k: PublicKeyHash, v: Bn256PublicKey) -> Option<Bn256PublicKey> {
        if v.is_valid() {
            self.bn256.insert(k, v)
        } else {
            log::warn!(
                "Ignoring invalid bn256 public key {:02x?} specified by PKH {:02x?}",
                v,
                k
            );
            None
        }
    }
    /// Retain only the identities that return true when applied the input function.
    /// Used to remove multiple identities at once
    pub fn retain<F>(&mut self, mut f: F)
    where
        F: FnMut(&PublicKeyHash) -> bool,
    {
        self.bn256.retain(|k, _v| f(k));
    }
    /// Insert all bn256 public keys that appeared in the block (from miner and/or committers)
    pub fn insert_keys_from_block(&mut self, block: &Block) {
        // Add miner bn256 public keys
        if let Some(value) = block.block_header.bn256_public_key.as_ref() {
            self.insert_bn256(block.block_header.proof.proof.pkh(), value.clone());
        }
        // Add bn256 public keys from commitment transactions
        for commit in &block.txns.commit_txns {
            if let Some(value) = commit.body.bn256_public_key.as_ref() {
                self.insert_bn256(commit.body.proof.proof.pkh(), value.clone());
            }
        }
    }
}

/// State related to the Reputation Engine
#[derive(Debug, PartialEq, Clone, Serialize, Deserialize)]
pub struct ReputationEngine {
    /// Total number of witnessing acts
    current_alpha: Alpha,
    /// Reputation to be split between honest identities in the next epoch
    pub extra_reputation: Reputation,
    /// Total Reputation Set
    trs: TotalReputationSet<PublicKeyHash, Reputation, Alpha>,
    /// Active Reputation Set
    ars: ActiveReputationSet<PublicKeyHash>,
    /// Cached results of self.threshold_factor
    #[serde(skip)]
    threshold_cache: RefCell<ReputationThresholdCache>,
}

impl ReputationEngine {
    /// Initial state of the Reputation Engine at epoch 0
    pub fn new(activity_period: usize) -> Self {
        Self {
            current_alpha: Alpha(0),
            extra_reputation: Reputation(0),
            trs: TotalReputationSet::default(),
            ars: ActiveReputationSet::new(activity_period),
            threshold_cache: RefCell::default(),
        }
    }

    pub fn trs(&self) -> &TotalReputationSet<PublicKeyHash, Reputation, Alpha> {
        &self.trs
    }
    pub fn ars(&self) -> &ActiveReputationSet<PublicKeyHash> {
        &self.ars
    }
    pub fn trs_mut(&mut self) -> &mut TotalReputationSet<PublicKeyHash, Reputation, Alpha> {
        self.invalidate_reputation_threshold_cache();

        &mut self.trs
    }
    pub fn ars_mut(&mut self) -> &mut ActiveReputationSet<PublicKeyHash> {
        self.invalidate_reputation_threshold_cache();

        &mut self.ars
    }

    /// Sort the active identities by reputation. This is an internal method, use
    /// `get_rep_ordered_ars_list` instead.
    fn calculate_rep_ordered_ars_list(&self) -> Vec<PublicKeyHash> {
        // Get list of identities and their reputation, and sort them by reputation
        let mut identities_and_reputation: Vec<_> = self
            .ars
            .active_identities()
            .map(|pkh| (pkh, self.trs().get(pkh), Cell::new(None)))
            .collect();
        // Using unstable sort because it's impossible to have two equal elements in this list
        identities_and_reputation
            .sort_unstable_by(|a, b| compare_reputed_pkh(a, b, self.current_alpha));
        let sorted_identities: Vec<_> = identities_and_reputation
            .into_iter()
            .map(|(pkh, _reputation, _cached_hash)| *pkh)
            .collect();

        sorted_identities
    }

    /// Calculate total active reputation and sorted active reputation
    fn calculate_active_rep(
        &self,
    ) -> (
        u64,
        Vec<u32>,
        HashMap<PublicKeyHash, u32>,
        Vec<PublicKeyHash>,
    ) {
        let sorted_identities = self.calculate_rep_ordered_ars_list();

        // Redistribute the reputation along the trapezoid
        let (trapezoid_hm, total_trapezoid_rep) =
            trapezoidal_eligibility(&sorted_identities, self.trs());

        // Total active reputation
        let total_active_rep = u64::from(total_trapezoid_rep) + sorted_identities.len() as u64;

        let sorted_rep = sorted_identities
            .iter()
            .map(|pkh| *trapezoid_hm.get(pkh).unwrap_or(&0) + 1)
            .collect();

        (
            total_active_rep,
            sorted_rep,
            trapezoid_hm,
            sorted_identities,
        )
    }

    /// Return a factor to increase the threshold dynamically
    pub fn threshold_factor(&self, witnesses_number: u16) -> u32 {
        self.threshold_cache
            .borrow_mut()
            .threshold_factor(witnesses_number, || self.calculate_active_rep())
    }

    /// Return the total active reputation, adding 1 point for every active identity
    pub fn total_active_reputation(&self) -> u64 {
        self.threshold_cache
            .borrow_mut()
            .total_active_reputation(|| self.calculate_active_rep())
    }

    pub fn get_eligibility(&self, pkh: &PublicKeyHash) -> u32 {
        self.threshold_cache
            .borrow_mut()
            .get_trapezoidal_eligibility(pkh, || self.calculate_active_rep())
    }

    /// Invalidate cached values of self.threshold_factor
    /// Must be called after mutating self.ars or self.trs
    pub fn invalidate_reputation_threshold_cache(&self) {
        self.threshold_cache.borrow_mut().invalidate()
    }

    /// Check if the given `pkh` is in the Active Reputation Set
    pub fn is_ars_member(&self, pkh: &PublicKeyHash) -> bool {
        self.ars.contains(pkh)
    }

    pub fn clear_threshold_cache(&self) {
        self.threshold_cache.borrow_mut().clear_threshold_cache()
    }

    /// Get ARS keys ordered by reputation. If tie, order by pkh.
    pub fn get_rep_ordered_ars_list(&self) -> Vec<PublicKeyHash> {
        self.threshold_cache
            .borrow_mut()
            .get_rep_ordered_ars_list(|| self.calculate_active_rep())
            .to_vec()
    }

    /// Get total number of witnessing acts
    pub fn current_alpha(&self) -> Alpha {
        self.current_alpha
    }

    /// Set total number of witnessing acts
    pub fn set_current_alpha(&mut self, new_alpha: Alpha) {
        // Changing the alpha counter invalidates the list of identities sorted by reputation,
        // because alpha is used as a tie-breaker
        if self.current_alpha != new_alpha {
            self.invalidate_reputation_threshold_cache();
            self.current_alpha = new_alpha;
        }
    }
}

/// Hash of PublicKeyHash and alpha clock, used to sort identities when there is a reputation tie
// We use an additional alpha paramater because comparing only by pkh creates a problem where some
// identities are always better than others.
fn pkh_alpha_hash(pkh: &PublicKeyHash, alpha: Alpha) -> Hash {
    let alpha_bytes: &[u8] = &alpha.0.to_be_bytes();
    let mut pkh_bytes = Vec::with_capacity(pkh.hash.len() + alpha_bytes.len());
    pkh_bytes.extend(pkh.hash);
    pkh_bytes.extend(alpha_bytes);

    calculate_sha256(&pkh_bytes).into()
}

/// Compare 2 PublicKeyHashes comparing:
/// First: reputation
/// Second: Hashes related to PublicKeyHash and alpha clock || PublicKeyHashes in case of 0 rep
fn compare_reputed_pkh(
    a: &(&PublicKeyHash, Reputation, Cell<Option<Hash>>),
    b: &(&PublicKeyHash, Reputation, Cell<Option<Hash>>),
    alpha: Alpha,
) -> Ordering {
    let (pkh_a, rep_a, _) = a;
    let (pkh_b, rep_b, _) = b;

    rep_a
        .cmp(rep_b)
        .then_with(|| {
            // If both identities have the same reputation, compare them by hash(pkh || alpha)
            // but only if their reputation is greater than 0
            if *rep_a > Reputation(0) {
                let get_hash = |(pkh, _rep, cached_hash): &(
                    &PublicKeyHash,
                    Reputation,
                    Cell<Option<Hash>>,
                )| {
                    // If possible, use the cached hash that was calculated in a previous iteration
                    // of the sort loop. This hash is only valid with the current alpha.
                    cached_hash.get().unwrap_or_else(|| {
                        // If there is no cached hash, calculate it and store it for later
                        let h = pkh_alpha_hash(pkh, alpha);
                        cached_hash.set(Some(h));
                        h
                    })
                };

                get_hash(a).cmp(&get_hash(b))
            } else {
                // If both identities have 0 reputation their ordering is not important because
                // they will have the same eligibility, so compare them by PublicKeyHash
                pkh_a.cmp(pkh_b)
            }
        })
        // Reverse the order: identities with most reputation should be first
        .reverse()
}

/// Calculate the result of `y = mx + K`
/// The result is rounded and low saturated in 0
#[allow(clippy::cast_possible_truncation, clippy::cast_sign_loss)]
fn magic_line(x: f64, m: f64, k: f64) -> u32 {
    let res = m * x + k;
    if res < 0_f64 {
        0
    } else {
        res.round() as u32
    }
}

/// List only those identities with reputation greater than zero
fn filter_reputed_identities(
    identities: &[PublicKeyHash],
    trs: &TotalReputationSet<PublicKeyHash, Reputation, Alpha>,
) -> (Vec<PublicKeyHash>, u32) {
    let mut total_rep = 0;
    let filtered_identities = identities
        .iter()
        .filter_map(|pkh| {
            // Identities with zero reputation will be excluded for the trapezoid calculations
            let rep = trs.get(pkh).0;
            if rep != 0 {
                total_rep += rep;
                Some(*pkh)
            } else {
                None
            }
        })
        .collect();

    (filtered_identities, total_rep)
}

/// Calculate the values and the total reputation
/// for the upper triangle of the trapezoid
#[allow(clippy::cast_precision_loss)]
fn calculate_trapezoid_triangle(
    total_active_rep: u32,
    active_reputed_ids_len: usize,
    minimum_rep: u32,
) -> (Vec<u32>, u32) {
    let minimum = f64::from(minimum_rep);

    // Calculate parameters for the curve y = mx + k
    // k: 1'5 * average of the total active reputation without the minimum
    let average = f64::from(total_active_rep) / active_reputed_ids_len as f64;
    let k = 1.5 * (average - minimum);
    // m: negative slope with -k
    let m = -k / ((active_reputed_ids_len as f64) - 1_f64);

    let mut total_triangle_reputation = 0;
    let mut triangle_reputation = vec![];

    for i in 0..active_reputed_ids_len {
        let calculated_rep = magic_line(i as f64, m, k);
        total_triangle_reputation += calculated_rep;
        triangle_reputation.push(calculated_rep);
    }

    (triangle_reputation, total_triangle_reputation)
}

/// Use the trapezoid distribution to calculate eligibility for each of the identities
/// in the ARS based on their reputation ranking
#[allow(clippy::cast_possible_truncation, clippy::cast_precision_loss)]
fn trapezoidal_eligibility(
    sorted_identities: &[PublicKeyHash],
    trs: &TotalReputationSet<PublicKeyHash, Reputation, Alpha>,
) -> (HashMap<PublicKeyHash, u32>, u32) {
    let (active_reputed_ids, total_active_rep) = filter_reputed_identities(sorted_identities, trs);
    let active_reputed_ids_len = active_reputed_ids.len();

    if active_reputed_ids_len == 0 {
        return (HashMap::default(), 0);
    }
    // Calculate upper triangle reputation in the trapezoidal eligibility
    let minimum_rep = trs.get(active_reputed_ids.last().unwrap()).0;
    let (triangle_reputation, total_triangle_reputation) =
        calculate_trapezoid_triangle(total_active_rep, active_reputed_ids_len, minimum_rep);

    // To complete the trapezoid, an offset needs to be added (the rectangle at the base)
    let remaining_reputation = total_active_rep - total_triangle_reputation;
    let offset_reputation = remaining_reputation / (active_reputed_ids_len as u32);
    let ids_with_extra_rep = (remaining_reputation as usize) % active_reputed_ids_len;

    let mut hm = HashMap::default();
    for (i, (pkh, rep)) in active_reputed_ids
        .into_iter()
        .zip(triangle_reputation.iter())
        .enumerate()
    {
        let mut trapezoid_rep = rep + offset_reputation;
        if i < ids_with_extra_rep {
            trapezoid_rep += 1;
        }

        // Include the modified reputation in the hashmap
        hm.insert(pkh, trapezoid_rep);
    }

    (hm, total_active_rep)
}

#[derive(Clone, Debug, Default, PartialEq, Eq)]
struct ReputationThresholdCache {
    valid: bool,
    total_active_rep: u64,
    sorted_active_rep: Vec<u32>,
    sorted_identities: Vec<PublicKeyHash>,
    threshold: HashMap<u16, u32>,
    trapezoid_rep: HashMap<PublicKeyHash, u32>,
}

impl ReputationThresholdCache {
    fn clear_threshold_cache(&mut self) {
        self.threshold.clear();
    }
    fn initialize(
        &mut self,
        total_active_rep: u64,
        sorted_active_rep: Vec<u32>,
        trapezoid_rep: HashMap<PublicKeyHash, u32>,
        sorted_identities: Vec<PublicKeyHash>,
    ) {
        self.threshold.clear();
        self.total_active_rep = total_active_rep;
        self.sorted_active_rep = sorted_active_rep;
        self.sorted_identities = sorted_identities;
        self.valid = true;
        self.trapezoid_rep = trapezoid_rep;
    }

    fn get_trapezoidal_eligibility<F>(&mut self, pkh: &PublicKeyHash, gen: F) -> u32
    where
        F: Fn() -> (
            u64,
            Vec<u32>,
            HashMap<PublicKeyHash, u32>,
            Vec<PublicKeyHash>,
        ),
    {
        if !self.valid {
            let (total_active_rep, sorted_active_rep, trapezoid_rep, sorted_identities) = gen();
            self.initialize(
                total_active_rep,
                sorted_active_rep,
                trapezoid_rep,
                sorted_identities,
            );
        }

        *self.trapezoid_rep.get(pkh).unwrap_or(&0)
    }

    fn invalidate(&mut self) {
        self.valid = false;
    }

    fn threshold_factor<F>(&mut self, n: u16, gen: F) -> u32
    where
        F: Fn() -> (
            u64,
            Vec<u32>,
            HashMap<PublicKeyHash, u32>,
            Vec<PublicKeyHash>,
        ),
    {
        if !self.valid {
            let (total_active_rep, sorted_active_rep, trapezoid_rep, sorted_identities) = gen();
            self.initialize(
                total_active_rep,
                sorted_active_rep,
                trapezoid_rep,
                sorted_identities,
            );
        }

        let Self {
            total_active_rep,
            sorted_active_rep,
            threshold,
            ..
        } = self;

        *threshold.entry(n).or_insert_with(|| {
            internal_threshold_factor(
                u64::from(n),
                *total_active_rep,
                sorted_active_rep.iter().copied(),
            )
        })
    }

    fn total_active_reputation<F>(&mut self, gen: F) -> u64
    where
        F: Fn() -> (
            u64,
            Vec<u32>,
            HashMap<PublicKeyHash, u32>,
            Vec<PublicKeyHash>,
        ),
    {
        if !self.valid {
            let (total_active_rep, sorted_active_rep, trapezoid_rep, sorted_identities) = gen();
            self.initialize(
                total_active_rep,
                sorted_active_rep,
                trapezoid_rep,
                sorted_identities,
            );
        }

        self.total_active_rep
    }

    fn get_rep_ordered_ars_list<F>(&mut self, gen: F) -> &[PublicKeyHash]
    where
        F: Fn() -> (
            u64,
            Vec<u32>,
            HashMap<PublicKeyHash, u32>,
            Vec<PublicKeyHash>,
        ),
    {
        if !self.valid {
            let (total_active_rep, sorted_active_rep, trapezoid_rep, sorted_identities) = gen();
            self.initialize(
                total_active_rep,
                sorted_active_rep,
                trapezoid_rep,
                sorted_identities,
            );
        }

        &self.sorted_identities
    }
}

/// Internal function for the threshold_factor function
fn internal_threshold_factor<I>(mut n: u64, total_rep: u64, rep_sorted: I) -> u32
where
    I: Iterator<Item = u32>,
{
    if n == 0 {
        return 0;
    }

    let mut remaining_rep = total_rep;

    for top_rep in rep_sorted {
        if (u64::from(top_rep) * n) > remaining_rep {
            n -= 1;
            remaining_rep -= u64::from(top_rep);
        } else {
            let factor = if (total_rep % remaining_rep) > 0 {
                (total_rep * n / remaining_rep) + 1
            } else {
                total_rep * n / remaining_rep
            };

            return u32::try_from(factor).unwrap_or(u32::MAX);
        }
    }

    u32::MAX
}

/// Witnessing Acts Counter
#[derive(Debug, Default, Serialize, Deserialize, Copy, Clone, PartialEq, Eq, PartialOrd, Ord)]
pub struct Alpha(pub u32);

impl AddAssign for Alpha {
    fn add_assign(&mut self, rhs: Self) {
        self.0 += rhs.0
    }
}

/// Reputation value
#[derive(Debug, Default, Serialize, Deserialize, Copy, Clone, PartialEq, Eq, PartialOrd, Ord)]
pub struct Reputation(pub u32);

impl AddAssign for Reputation {
    fn add_assign(&mut self, rhs: Self) {
        self.0 += rhs.0
    }
}

impl SubAssign for Reputation {
    fn sub_assign(&mut self, rhs: Self) {
        self.0 -= rhs.0
    }
}

/// Calculate the new issued reputation
pub fn reputation_issuance(
    reputation_issuance: Reputation,
    reputation_issuance_stop: Alpha,
    old_alpha: Alpha,
    new_alpha: Alpha,
) -> Reputation {
    if old_alpha >= reputation_issuance_stop {
        Reputation(0)
    } else {
        let new = std::cmp::min(reputation_issuance_stop.0, new_alpha.0);
        let alpha_diff = new - old_alpha.0;
        Reputation(alpha_diff * reputation_issuance.0)
    }
}

/// Penalization function.
/// Multiply total reputation by `penalization_factor` for each lie.
// FIXME: Allow for now, wait for https://github.com/rust-lang/rust/issues/67058 to reach stable
#[allow(clippy::cast_possible_truncation, clippy::cast_sign_loss)]
pub fn penalize_factor(
    penalization_factor: f64,
    num_lies: u32,
) -> impl Fn(Reputation) -> Reputation {
    move |Reputation(r)| {
        Reputation((f64::from(r) * penalization_factor.powf(f64::from(num_lies))) as u32)
    }
}

/// Constants used to convert between epoch and timestamp
#[derive(Copy, Clone, Debug)]
pub struct EpochConstants {
    /// Timestamp of checkpoint #0 (the second in which epoch #0 started)
    pub checkpoint_zero_timestamp: i64,

    /// Period between checkpoints, in seconds
    pub checkpoints_period: u16,

    /// Timestamp of checkpoint (in seconds) when v2 started)
    pub checkpoint_zero_timestamp_wit2: i64,

    /// Period between checkpoints, in seconds, starting at v2
    pub checkpoints_period_wit2: u16,
}

// This default is only used for tests
impl Default for EpochConstants {
    fn default() -> Self {
        Self {
            checkpoint_zero_timestamp: 0,
            // This cannot be 0 because we would divide by zero
            checkpoints_period: 1,
            // Variables for v2
            checkpoint_zero_timestamp_wit2: i64::MAX,
            // This cannot be 0 because we would divide by zero
            checkpoints_period_wit2: 1,
        }
    }
}

impl EpochConstants {
    /// Calculate the last checkpoint (current epoch) at the supplied timestamp
    pub fn epoch_at(&self, timestamp: i64) -> Result<Epoch, EpochCalculationError> {
        if timestamp >= self.checkpoint_zero_timestamp_wit2 {
            let epochs_pre_v2 = match Epoch::try_from(
                self.checkpoint_zero_timestamp_wit2 - self.checkpoint_zero_timestamp,
            ) {
                Ok(epoch) => epoch / Epoch::from(self.checkpoints_period),
                Err(_) => {
                    return Err(EpochCalculationError::CheckpointZeroInTheFuture(
                        self.checkpoint_zero_timestamp,
                    ));
                }
            };
            let epochs_post_v2 =
                match Epoch::try_from(timestamp - self.checkpoint_zero_timestamp_wit2) {
                    Ok(epoch) => epoch / Epoch::from(self.checkpoints_period_wit2),
                    Err(_) => {
                        return Err(EpochCalculationError::CheckpointZeroInTheFuture(
                            self.checkpoint_zero_timestamp,
                        ));
                    }
                };

            Ok(epochs_pre_v2 + epochs_post_v2)
        } else {
            Epoch::try_from(timestamp - self.checkpoint_zero_timestamp)
                .map(|epoch| epoch / Epoch::from(self.checkpoints_period))
                .map_err(|_| {
                    EpochCalculationError::CheckpointZeroInTheFuture(self.checkpoint_zero_timestamp)
                })
        }
    }

    /// Calculate the timestamp for a checkpoint (the start of an epoch)
    ///
    /// The return type is a tuple where the first item is the UNIX timestamp of corresponding the
    /// start of the queried protocol epoch, and the second item is a flag that tells if the epoch
    /// will happen after the 2_x hard fork.
    pub fn epoch_timestamp(&self, epoch: Epoch) -> Result<(i64, bool), EpochCalculationError> {
        let epoch_timestamp = Epoch::from(self.checkpoints_period)
            .checked_mul(epoch)
            .filter(|&x| x <= Epoch::MAX as Epoch)
            .map(i64::from)
            .and_then(|x| x.checked_add(self.checkpoint_zero_timestamp))
            .ok_or(EpochCalculationError::Overflow)?;

        let mut in_v2 = false;
        let timestamp = if epoch_timestamp >= self.checkpoint_zero_timestamp_wit2 {
            in_v2 = true;

            let epochs_pre_v2: u32 = u32::try_from(
                (self.checkpoint_zero_timestamp_wit2 - self.checkpoint_zero_timestamp)
                    / i64::from(self.checkpoints_period),
            )
            .map_err(|_| EpochCalculationError::Overflow)?;

            self.checkpoint_zero_timestamp_wit2
                + i64::from((epoch - epochs_pre_v2) * Epoch::from(self.checkpoints_period_wit2))
        } else {
            epoch_timestamp
        };

        Ok((timestamp, in_v2))
    }

    /// Calculate the timestamp for when block mining should happen.
    pub fn block_mining_timestamp(&self, epoch: Epoch) -> Result<i64, EpochCalculationError> {
        let (start, in_v2) = self.epoch_timestamp(epoch)?;
        // TODO: analyze when should nodes start mining a block
        // Start mining at the midpoint of the epoch
        let checkpoints_period = if in_v2 {
            self.checkpoints_period_wit2
        } else {
            self.checkpoints_period
        };

        let seconds_before_next_epoch = checkpoints_period / 2;

        start
            .checked_add(i64::from(checkpoints_period - seconds_before_next_epoch))
            .ok_or(EpochCalculationError::Overflow)
    }

    pub fn get_epoch_period(&self, epoch: Epoch) -> Result<u16, EpochCalculationError> {
        let (_, in_v2) = self.epoch_timestamp(epoch)?;
        if in_v2 {
            Ok(self.checkpoints_period_wit2)
        } else {
            Ok(self.checkpoints_period)
        }
    }

    pub fn set_values_for_wit2(
        &mut self,
        period: u16,
        epoch: Epoch,
    ) -> Result<(), EpochCalculationError> {
        self.checkpoints_period_wit2 = period;
        match self.epoch_timestamp(epoch) {
            Ok((timestamp, _)) => self.checkpoint_zero_timestamp_wit2 = timestamp,
            Err(e) => return Err(e),
        };

        Ok(())
    }
}

#[derive(Clone, Debug, Eq, PartialEq)]
pub enum SignaturesToVerify {
    VrfDr {
        proof: DataRequestEligibilityClaim,
        vrf_input: CheckpointVRF,
        dr_hash: Hash,
        target_hash: Hash,
        withdrawer: Option<PublicKeyHash>,
        inclusion_epoch: Option<Epoch>,
    },
    VrfBlock {
        proof: BlockEligibilityClaim,
        vrf_input: CheckpointVRF,
        target_hash: Hash,
    },
    SecpTx {
        public_key: Secp256k1_PublicKey,
        data: Vec<u8>,
        signature: Secp256k1_Signature,
    },
    SecpBlock {
        public_key: Secp256k1_PublicKey,
        data: Vec<u8>,
        signature: Secp256k1_Signature,
    },
    SuperBlockVote {
        superblock_vote: SuperBlockVote,
    },
}

// Auxiliar functions for test
pub fn transaction_example() -> Transaction {
    let keyed_signature = vec![KeyedSignature::default()];
    let data_request_input = Input::default();
    let value_transfer_output = ValueTransferOutput::default();

    let rad_retrieve = RADRetrieve {
        url: "https://openweathermap.org/data/2.5/weather?id=2950159&appid=b6907d289e10d714a6e88b30761fae22".to_string(),
        kind: RADType::HttpGet,
        ..RADRetrieve::default()
    };

    let rad_request = RADRequest {
        retrieve: vec![rad_retrieve.clone(), rad_retrieve],
        ..RADRequest::default()
    };
    let data_request_output = DataRequestOutput {
        data_request: rad_request,
        ..DataRequestOutput::default()
    };

    let inputs = vec![data_request_input];
    let outputs = vec![value_transfer_output];

    Transaction::DataRequest(DRTransaction::new(
        DRTransactionBody::new(inputs, data_request_output, outputs),
        keyed_signature,
    ))
}

pub fn block_example() -> Block {
    let block_header = BlockHeader::default();
    let block_sig = KeyedSignature::default();

    let mut dr_txns = vec![];
    if let Transaction::DataRequest(dr_tx) = transaction_example() {
        dr_txns.push(dr_tx);
    }

    let txns = BlockTransactions {
        data_request_txns: dr_txns,
        ..BlockTransactions::default()
    };

    Block::new(block_header, block_sig, txns)
}
#[cfg(test)]
mod tests {
    use witnet_crypto::{
        merkle::{merkle_tree_root, InclusionProof},
        secp256k1::{PublicKey as Secp256k1_PublicKey, SecretKey as Secp256k1_SecretKey},
        signature::sign,
    };

    use crate::{
        proto::versioning::{ProtocolVersion, VersionedHashable},
        superblock::{mining_build_superblock, ARSIdentities},
        transaction::{CommitTransactionBody, RevealTransactionBody, VTTransactionBody},
    };

    use super::*;

    fn dr_root_superblock_loop_test(
        sb: SuperBlock,
        expected_indices: Vec<usize>,
        expected_lemma_lengths: Vec<usize>,
        blocks: Vec<Block>,
        dr_txs: Vec<DRTransaction>,
    ) {
        for index in 0..expected_indices.len() {
            let result = sb.dr_proof_of_inclusion(&blocks, &dr_txs[index]).unwrap();
            assert_eq!(result.index, expected_indices[index]);
            assert_eq!(result.lemma.len(), expected_lemma_lengths[index]);
            let lemma = result
                .lemma
                .iter()
                .map(|h| match *h {
                    Hash::SHA256(x) => Sha256(x),
                })
                .collect();
            let proof = InclusionProof::sha256(result.index, lemma);
            assert!(proof.verify(
                dr_txs[index]
                    .body
                    .data_poi_hash(ProtocolVersion::default())
                    .into(),
                sb.data_request_root.into()
            ));
        }
    }

    fn tally_root_superblock_loop_test(
        sb: SuperBlock,
        expected_indices: Vec<usize>,
        expected_lemma_lengths: Vec<usize>,
        blocks: Vec<Block>,
        tally_txs: Vec<TallyTransaction>,
        protocol_version: ProtocolVersion,
    ) {
        for index in 0..expected_indices.len() {
            let result = sb
                .tally_proof_of_inclusion(&blocks, &tally_txs[index], protocol_version)
                .unwrap();
            assert_eq!(result.index, expected_indices[index]);
            assert_eq!(result.lemma.len(), expected_lemma_lengths[index]);
            let lemma = result
                .lemma
                .iter()
                .map(|h| match *h {
                    Hash::SHA256(x) => Sha256(x),
                })
                .collect();
            let proof = InclusionProof::sha256(result.index, lemma);
            let data_poi_hash = tally_txs[index].data_poi_hash();
            assert!(proof.verify(data_poi_hash.into(), sb.tally_root.into()));
        }
    }

    fn build_test_dr_txs(length: u32) -> Vec<DRTransaction> {
        let inputs: Vec<Input> = (1..=length)
            .map(|x| {
                Input::new(OutputPointer {
                    transaction_id: Hash::default(),
                    output_index: x,
                })
            })
            .collect();
        let dr_txs: Vec<DRTransaction> = inputs
            .iter()
            .map(|input| {
                DRTransaction::new(
                    DRTransactionBody::new(vec![*input], DataRequestOutput::default(), vec![]),
                    vec![],
                )
            })
            .collect();
        dr_txs
    }

    fn build_test_tally_txs(length: u64) -> Vec<TallyTransaction> {
        let outputs: Vec<ValueTransferOutput> = (1..=length)
            .map(|x| ValueTransferOutput {
                pkh: PublicKeyHash::default(),
                value: x,
                time_lock: x,
            })
            .collect();
        let tally_txs: Vec<TallyTransaction> = outputs
            .iter()
            .map(|output| {
                TallyTransaction::new(
                    Hash::default(),
                    vec![],
                    vec![output.clone()],
                    vec![],
                    vec![],
                )
            })
            .collect();
        tally_txs
    }

    #[test]
    fn test_block_header_serialization_across_protocol_versions() {
        let block = block_example();
        assert_ne!(
            hex::encode(
                block
                    .block_header
                    .to_versioned_pb_bytes(ProtocolVersion::V1_7)
                    .unwrap()
            ),
            hex::encode(
                block
                    .block_header
                    .to_versioned_pb_bytes(ProtocolVersion::V1_8)
                    .unwrap()
            ),
        );
        assert_eq!(
            hex::encode(
                block
                    .block_header
                    .to_versioned_pb_bytes(ProtocolVersion::V1_8)
                    .unwrap()
            ),
            hex::encode(
                block
                    .block_header
                    .to_versioned_pb_bytes(ProtocolVersion::V2_0)
                    .unwrap()
            ),
        );
    }

    #[test]
    fn test_block_header_hashing_across_protocol_versions() {
        let block = block_example();
        assert_ne!(
            hex::encode(block.block_header.versioned_hash(ProtocolVersion::V1_7)),
            hex::encode(block.block_header.versioned_hash(ProtocolVersion::V1_8)),
        );
        assert_eq!(
            hex::encode(block.block_header.versioned_hash(ProtocolVersion::V1_8)),
            hex::encode(block.block_header.versioned_hash(ProtocolVersion::V2_0)),
        );
    }

    #[test]
    fn test_block_hashing_across_protocol_versions() {
        let block = block_example();
        assert_ne!(
            hex::encode(block.versioned_hash(ProtocolVersion::V1_7)),
            hex::encode(block.versioned_hash(ProtocolVersion::V1_8)),
        );
        assert_eq!(
            hex::encode(block.versioned_hash(ProtocolVersion::V1_8)),
            hex::encode(block.versioned_hash(ProtocolVersion::V2_0)),
        );
    }

    #[test]
    fn test_block_hashing_matches_block_header_hashing() {
        let block = block_example();
        assert_eq!(
            hex::encode(block.versioned_hash(ProtocolVersion::V1_7)),
            hex::encode(block.block_header.versioned_hash(ProtocolVersion::V1_7)),
        );
        assert_eq!(
            hex::encode(block.versioned_hash(ProtocolVersion::V1_8)),
            hex::encode(block.block_header.versioned_hash(ProtocolVersion::V1_8)),
        );
        assert_eq!(
            hex::encode(block.versioned_hash(ProtocolVersion::V2_0)),
            hex::encode(block.block_header.versioned_hash(ProtocolVersion::V2_0)),
        );
    }

    #[test]
    fn test_block_hashable_trait() {
        let block = block_example();
        let expected = "70e15ac70bb00f49c7a593b2423f722dca187bbae53dc2f22647063b17608c01";
        assert_eq!(
            block.versioned_hash(ProtocolVersion::V1_7).to_string(),
            expected
        );
        let expected = "29ef68357a5c861b9dbe043d351a28472ca450edcda25de4c9b80a4560a28c0f";
        assert_eq!(
            block.versioned_hash(ProtocolVersion::V1_8).to_string(),
            expected
        );
        let expected = "29ef68357a5c861b9dbe043d351a28472ca450edcda25de4c9b80a4560a28c0f";
        assert_eq!(
            block.versioned_hash(ProtocolVersion::V2_0).to_string(),
            expected
        );
    }

    #[test]
    fn test_transaction_hashable_trait() {
        let transaction = transaction_example();
        let expected = "9221b651aaef0f6d75a175958825775ed0add54102a431a27e485052478e0f9b";

        // Signatures don't affect the hash of a transaction (SegWit style), thus both must be equal
        assert_eq!(transaction.hash().to_string(), expected);
        if let Transaction::DataRequest(dr_tx) = transaction {
            assert_eq!(dr_tx.body.hash().to_string(), expected);
        }
    }

    #[test]
    fn test_superblock_hashable_trait() {
        let superblock = SuperBlock::new(
            3,
            Hash::SHA256([1; 32]),
            Hash::SHA256([2; 32]),
            1,
            Hash::SHA256([3; 32]),
            Hash::SHA256([4; 32]),
            Hash::SHA256([5; 32]),
        );
        let expected = "c9a800eb2c8047b05b660137771ccda4fa34e02fb7bc8d178747b0b3ae987875";
        assert_eq!(superblock.hash().to_string(), expected);
    }

    #[test]
    fn test_superblock_hashable_trait_2() {
        let superblock = SuperBlock::new(
            0x0fff_ffff,
            Hash::SHA256([1; 32]),
            Hash::SHA256([2; 32]),
            0x0020_2020,
            Hash::SHA256([3; 32]),
            Hash::SHA256([4; 32]),
            Hash::SHA256([5; 32]),
        );
        let expected = "244961e865ad0e295184912cfd90032e3c400c08c959b49fda51e05eae1a7c66";
        assert_eq!(superblock.hash().to_string(), expected);
    }

    #[test]
    fn test_superblock_hashable_trait_3() {
        let superblock = SuperBlock::new(
            0x000a_456b,
            Hash::SHA256([1; 32]),
            Hash::SHA256([2; 32]),
            0x20a6_b256,
            Hash::SHA256([3; 32]),
            Hash::SHA256([4; 32]),
            Hash::SHA256([5; 32]),
        );
        let expected = "e70684a7f72668a7b77fe2d9add8f798b012efd8a551bd37167d02b345ecb2fa";
        assert_eq!(superblock.hash().to_string(), expected);
    }

    #[test]
    fn test_superblock_hashable_trait_4() {
        let dr_root =
            hex::decode("000000000000000000000000000000000000000000000000000876564fd345ea")
                .unwrap()
                .as_slice()
                .try_into()
                .unwrap();
        let tally_root =
            hex::decode("0000000000000000000000000000000000000000000000000000543feab6575c")
                .unwrap()
                .as_slice()
                .try_into()
                .unwrap();
        let last_block_hash =
            hex::decode("0000000000000000000000000000000000000000000000000000023986aecd34")
                .unwrap()
                .as_slice()
                .try_into()
                .unwrap();
        let prev_last_block_hash =
            hex::decode("0000000000000000000000000000000000000000000000000000098fe34ad3c5")
                .unwrap()
                .as_slice()
                .try_into()
                .unwrap();
        let ars_root =
            hex::decode("00000000000000000000000000000000000000000000000000000034742d5a7c")
                .unwrap()
                .as_slice()
                .try_into()
                .unwrap();

        let superblock = SuperBlock::new(
            0x000a_456b,
            Hash::SHA256(ars_root),
            Hash::SHA256(dr_root),
            0x0020_a6b2,
            Hash::SHA256(last_block_hash),
            Hash::SHA256(prev_last_block_hash),
            Hash::SHA256(tally_root),
        );
        let expected = "329349f85dd42d0b59c014a6f859b26185c488dc3ca13c036ddc751916220c77";
        assert_eq!(superblock.hash().to_string(), expected);
    }

    #[test]
    fn test_superblock_hashable_trait_5() {
        let dr_root =
            hex::decode("000000000000000000000000000000000000000000000000000000000000ffff")
                .unwrap()
                .as_slice()
                .try_into()
                .unwrap();
        let tally_root =
            hex::decode("0000000000000000000000000000000000000000000000000000000020a6b256")
                .unwrap()
                .as_slice()
                .try_into()
                .unwrap();
        let last_block_hash =
            hex::decode("0000000000000000000000000000000000000000000000000000023986aecd34")
                .unwrap()
                .as_slice()
                .try_into()
                .unwrap();
        let prev_last_block_hash =
            hex::decode("000000000000000000000000000000000000000000000000000000034ba23cc5")
                .unwrap()
                .as_slice()
                .try_into()
                .unwrap();
        let ars_root =
            hex::decode("00000000000000000000000000000000000000000000000000000034742d5a7c")
                .unwrap()
                .as_slice()
                .try_into()
                .unwrap();

        let superblock = SuperBlock::new(
            0x0012_34ad,
            Hash::SHA256(ars_root),
            Hash::SHA256(dr_root),
            0x0765_64fd,
            Hash::SHA256(last_block_hash),
            Hash::SHA256(prev_last_block_hash),
            Hash::SHA256(tally_root),
        );
        let expected = "4afd32e477049920cc70dd223657c0574a700ee18aad2463a4b528bfa8de6d99";
        assert_eq!(superblock.hash().to_string(), expected);
    }

    #[test]
    fn test_superblock_hashable_trait_6() {
        let dr_root =
            hex::decode("00000000000000000000000000000000000000000000000000000fffffffffff")
                .unwrap()
                .as_slice()
                .try_into()
                .unwrap();
        let tally_root =
            hex::decode("00000000000000000000000000000000000000000000000000000fffffffffff")
                .unwrap()
                .as_slice()
                .try_into()
                .unwrap();
        let last_block_hash =
            hex::decode("00000000000000000000000000000000000000000000000000000fffffffffff")
                .unwrap()
                .as_slice()
                .try_into()
                .unwrap();
        let prev_last_block_hash =
            hex::decode("00000000000000000000000000000000000000000000000000000fffffffffff")
                .unwrap()
                .as_slice()
                .try_into()
                .unwrap();
        let ars_root =
            hex::decode("00000000000000000000000000000000000000000000000000000fffffffffff")
                .unwrap()
                .as_slice()
                .try_into()
                .unwrap();

        let superblock = SuperBlock::new(
            0x0fff_ffff,
            Hash::SHA256(ars_root),
            Hash::SHA256(dr_root),
            0x00ff_ffff,
            Hash::SHA256(last_block_hash),
            Hash::SHA256(prev_last_block_hash),
            Hash::SHA256(tally_root),
        );
        let expected = "c87b63079813d3eca051f11f07ad555280ff9a7e44f3b1d42c1d309d25392327";
        assert_eq!(superblock.hash().to_string(), expected);
    }

    #[test]
    fn test_superblock_vote_bn256_signature_message() {
        // If this test fails, the bridge will also fail
        let superblock_hash = "4ee0395751a5b8d94217ba71623414721ab8dc8c1634a5c79769d5196a1b3993"
            .parse()
            .unwrap();
        let superblock_vote = SuperBlockVote::new_unsigned(superblock_hash, 1);
        let expected_bls =
            hex::decode("000000014ee0395751a5b8d94217ba71623414721ab8dc8c1634a5c79769d5196a1b3993")
                .unwrap();
        assert_eq!(superblock_vote.bn256_signature_message(), expected_bls);
    }

    #[test]
    fn test_superblock_vote_secp256k1_signature_message() {
        let superblock_hash = "4ee0395751a5b8d94217ba71623414721ab8dc8c1634a5c79769d5196a1b3993"
            .parse()
            .unwrap();
        let mut superblock_vote = SuperBlockVote::new_unsigned(superblock_hash, 1);
        superblock_vote.bn256_signature.signature =
            hex::decode("03100709d625d82c4eedf5f330d538b0cfa0dd68a5c505b6896902ed935b5cce0e")
                .unwrap();
        let expected_secp = hex::decode("000000014ee0395751a5b8d94217ba71623414721ab8dc8c1634a5c79769d5196a1b399303100709d625d82c4eedf5f330d538b0cfa0dd68a5c505b6896902ed935b5cce0e").unwrap();
        assert_eq!(superblock_vote.secp256k1_signature_message(), expected_secp);
    }

    #[test]
    fn test_output_pointer_from_str() {
        let result_success = OutputPointer::from_str(
            "1111111111111111111111111111111111111111111111111111111111111111:1",
        );
        let result_error_short = OutputPointer::from_str("11111");

        let result_error_long = OutputPointer::from_str(
            "1111111111111111111111111111111111111111111111111111111111111111111:1",
        );

        let result_error_format_1 = OutputPointer::from_str(":");

        let result_error_format_2 = OutputPointer::from_str(
            "1111111111111111111111111111111111111111111111111111111111111111:b",
        );

        let result_error_format_3 = OutputPointer::from_str(
            "1111111111111111111111111111111111111111111111111111111111111111:1a",
        );

        let expected = OutputPointer {
            transaction_id: Hash::SHA256([
                17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
                17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
            ]),
            output_index: 1,
        };

        assert_eq!(result_success.unwrap(), expected);
        assert!(result_error_short.is_err());
        assert!(result_error_long.is_err());
        assert!(result_error_format_1.is_err());
        assert!(result_error_format_2.is_err());
        assert!(result_error_format_3.is_err());
    }

    #[test]
    fn secp256k1_from_into_secpk256k1_signatures() {
        use crate::chain::Secp256k1Signature;
        use witnet_crypto::secp256k1::{
            ecdsa::Signature as Secp256k1_Signature, Message as Secp256k1_Message, Secp256k1,
            SecretKey as Secp256k1_SecretKey,
        };

        let data = [0xab; 32];
        let secp = Secp256k1::new();
        let secret_key =
            Secp256k1_SecretKey::from_slice(&[0xcd; 32]).expect("32 bytes, within curve order");
        let msg = Secp256k1_Message::from_digest_slice(&data).unwrap();
        let signature = secp.sign_ecdsa(&msg, &secret_key);

        let witnet_signature = Secp256k1Signature::from(signature);
        let signature_into: Secp256k1_Signature = witnet_signature.try_into().unwrap();

        assert_eq!(signature.to_string(), signature_into.to_string());
    }

    #[test]
    fn secp256k1_from_into_signatures() {
        use crate::chain::Signature;
        use witnet_crypto::secp256k1::{
            ecdsa::Signature as Secp256k1_Signature, Message as Secp256k1_Message, Secp256k1,
            SecretKey as Secp256k1_SecretKey,
        };

        let data = [0xab; 32];
        let secp = Secp256k1::new();
        let secret_key =
            Secp256k1_SecretKey::from_slice(&[0xcd; 32]).expect("32 bytes, within curve order");
        let msg = Secp256k1_Message::from_digest_slice(&data).unwrap();
        let signature = secp.sign_ecdsa(&msg, &secret_key);

        let witnet_signature = Signature::from(signature);
        let signature_into: Secp256k1_Signature = witnet_signature.try_into().unwrap();

        assert_eq!(signature.to_string(), signature_into.to_string());
    }

    #[test]
    fn secp256k1_from_into_public_keys() {
        use crate::chain::PublicKey;
        use witnet_crypto::secp256k1::{
            PublicKey as Secp256k1_PublicKey, Secp256k1, SecretKey as Secp256k1_SecretKey,
        };

        let secp = Secp256k1::new();
        let secret_key =
            Secp256k1_SecretKey::from_slice(&[0xcd; 32]).expect("32 bytes, within curve order");
        let public_key = Secp256k1_PublicKey::from_secret_key(&secp, &secret_key);

        let witnet_pk = PublicKey::from(public_key);
        let pk_into: Secp256k1_PublicKey = witnet_pk.try_into().unwrap();

        assert_eq!(public_key, pk_into);
    }

    #[test]
    fn secp256k1_from_into_secret_keys() {
        use crate::chain::SecretKey;
        use witnet_crypto::secp256k1::SecretKey as Secp256k1_SecretKey;

        let secret_key =
            Secp256k1_SecretKey::from_slice(&[0xcd; 32]).expect("32 bytes, within curve order");

        let witnet_sk = SecretKey::from(secret_key);
        let sk_into: Secp256k1_SecretKey = witnet_sk.into();

        assert_eq!(secret_key, sk_into);
    }

    #[test]
    fn secp256k1_from_into_extended_sk() {
        use witnet_crypto::key::MasterKeyGen;

        let seed = [
            62, 6, 109, 125, 238, 45, 191, 143, 205, 63, 226, 64, 163, 151, 86, 88, 202, 17, 138,
            143, 111, 76, 168, 28, 249, 145, 4, 148, 70, 4, 176, 90, 80, 144, 167, 157, 153, 229,
            69, 112, 75, 145, 76, 160, 57, 127, 237, 184, 47, 208, 15, 214, 167, 32, 152, 112, 55,
            9, 200, 145, 160, 101, 238, 73,
        ];

        let extended_sk = MasterKeyGen::new(&seed[..]).generate().unwrap();

        let witnet_extended_sk = ExtendedSecretKey::from(extended_sk.clone());
        let extended_sk_into = witnet_extended_sk.into();

        assert_eq!(extended_sk, extended_sk_into);
    }

    #[test]
    fn hash_ord() {
        // Make sure that the Ord implementation of Hash compares the hashes left to right
        let a = Hash::from_str("1111111111111111111111111111111111111111111111111111111111111111")
            .unwrap();
        let b = Hash::from_str("2111111111111111111111111111111111111111111111111111111111111110")
            .unwrap();
        assert!(a < b);
    }

    #[test]
    fn hash_from_str() {
        // 32 bytes
        let a = Hash::from_str("1111111111111111111111111111111111111111111111111111111111111111");
        assert!(a.is_ok());

        // 32.5 bytes
        assert!(matches!(
            Hash::from_str("11111111111111111111111111111111111111111111111111111111111111112"),
            Err(HashParseError::Hex(hex::FromHexError::OddLength))
        ));

        // 33 bytes
        assert!(matches!(
            Hash::from_str("111111111111111111111111111111111111111111111111111111111111111122"),
            Err(HashParseError::Hex(hex::FromHexError::InvalidStringLength))
        ));
    }

    #[test]
    fn bech32_ser_de() {
        let addr = "wit1gdm8mqlz8lxtj05w05mw63jvecyenvua7ajdk5";
        let hex = "43767d83e23fccb93e8e7d36ed464cce0999b39d";

        let addr_to_pkh = PublicKeyHash::from_bech32(Environment::Mainnet, addr).unwrap();
        let hex_to_pkh = PublicKeyHash::from_hex(hex).unwrap();
        assert_eq!(addr_to_pkh, hex_to_pkh);

        let pkh = addr_to_pkh;
        assert_eq!(pkh.bech32(Environment::Mainnet), addr);

        // If we change the environment, the prefix and the checksum change
        let addr_testnet = "twit1gdm8mqlz8lxtj05w05mw63jvecyenvuasgmfk9";
        assert_eq!(pkh.bech32(Environment::Testnet), addr_testnet);
        // But the PKH is the same as mainnet
        assert_eq!(
            PublicKeyHash::from_bech32(Environment::Testnet, addr_testnet).unwrap(),
            pkh
        );
        // Although if we try to deserialize this as a mainnet address, it will fail
        assert!(PublicKeyHash::from_bech32(Environment::Mainnet, addr_testnet).is_err());
    }

    #[test]
    fn transactions_pool_contains_commit_no_signatures() {
        let transactions_pool = TransactionsPool::default();
        let transaction = Transaction::Commit(CommitTransaction {
            body: Default::default(),
            signatures: vec![],
        });

        assert_eq!(transactions_pool.contains(&transaction), Ok(false));
    }

    #[test]
    fn transactions_pool_contains_reveal_no_signatures() {
        let transactions_pool = TransactionsPool::default();
        let transaction = Transaction::Reveal(RevealTransaction {
            body: Default::default(),
            signatures: vec![],
        });

        assert_eq!(transactions_pool.contains(&transaction), Ok(false));
    }

    #[test]
    fn transactions_pool_remove_all_transactions_with_same_output_pointer() {
        let input = Input::default();
        let vt_1 = VTTransaction::new(VTTransactionBody::new(vec![input], vec![]), vec![]);
        let vt_2 = VTTransaction::new(
            VTTransactionBody::new(vec![input], vec![ValueTransferOutput::default()]),
            vec![],
        );

        let dr_1 = DRTransaction::new(
            DRTransactionBody::new(vec![input], DataRequestOutput::default(), vec![]),
            vec![],
        );
        let dr_2 = DRTransaction::new(
            DRTransactionBody::new(
                vec![input],
                DataRequestOutput::default(),
                vec![ValueTransferOutput::default()],
            ),
            vec![],
        );

        let vt1 = Transaction::ValueTransfer(vt_1.clone());
        let vt2 = Transaction::ValueTransfer(vt_2);
        assert_ne!(vt1.hash(), vt2.hash());

        let dr1 = Transaction::DataRequest(dr_1.clone());
        let dr2 = Transaction::DataRequest(dr_2);
        assert_ne!(dr1.hash(), dr2.hash());

        let mut transactions_pool = TransactionsPool::default();
        transactions_pool.insert(vt1.clone(), 1);
        transactions_pool.insert(vt2.clone(), 1);
        let t = transactions_pool.vt_remove(&vt_1).unwrap();
        assert_eq!(Transaction::ValueTransfer(t), vt1);
        assert!(!transactions_pool.contains(&vt1).unwrap());
        assert!(!transactions_pool.contains(&vt2).unwrap());

        let mut transactions_pool = TransactionsPool::default();
        transactions_pool.insert(vt1.clone(), 1);
        transactions_pool.insert(dr2.clone(), 1);
        let t = transactions_pool.vt_remove(&vt_1).unwrap();
        assert_eq!(Transaction::ValueTransfer(t), vt1);
        assert!(!transactions_pool.contains(&vt1).unwrap());
        assert!(!transactions_pool.contains(&dr2).unwrap());

        let mut transactions_pool = TransactionsPool::default();
        transactions_pool.insert(dr1.clone(), 1);
        transactions_pool.insert(dr2.clone(), 1);
        let t = transactions_pool.dr_remove(&dr_1).unwrap();
        assert_eq!(Transaction::DataRequest(t), dr1);
        assert!(!transactions_pool.contains(&dr1).unwrap());
        assert!(!transactions_pool.contains(&dr2).unwrap());

        let mut transactions_pool = TransactionsPool::default();
        transactions_pool.insert(dr1.clone(), 1);
        transactions_pool.insert(vt2.clone(), 1);
        let t = transactions_pool.dr_remove(&dr_1).unwrap();
        assert_eq!(Transaction::DataRequest(t), dr1);
        assert!(!transactions_pool.contains(&dr1).unwrap());
        assert!(!transactions_pool.contains(&vt2).unwrap());

        let mut transactions_pool = TransactionsPool::default();
        // Do not insert vt1
        //transactions_pool.insert(vt1.clone(), 1);
        transactions_pool.insert(vt2.clone(), 1);
        // But remove vt1, maybe it was included in a block before the node received it
        let t = transactions_pool.vt_remove(&vt_1);
        assert_eq!(t, None);
        assert!(!transactions_pool.contains(&vt1).unwrap());
        assert!(!transactions_pool.contains(&vt2).unwrap());
    }

    #[test]
    fn transactions_pool_not_remove_transaction_with_different_output_pointer() {
        let input = Input::default();
        let input2 = Input::new(OutputPointer {
            output_index: 1,
            transaction_id: Hash::default(),
        });
        let vt_1 = VTTransaction::new(VTTransactionBody::new(vec![input], vec![]), vec![]);
        let vt_2 = VTTransaction::new(
            VTTransactionBody::new(vec![input2], vec![ValueTransferOutput::default()]),
            vec![],
        );

        let dr_1 = DRTransaction::new(
            DRTransactionBody::new(vec![input], DataRequestOutput::default(), vec![]),
            vec![],
        );
        let dr_2 = DRTransaction::new(
            DRTransactionBody::new(
                vec![input2],
                DataRequestOutput::default(),
                vec![ValueTransferOutput::default()],
            ),
            vec![],
        );

        let vt1 = Transaction::ValueTransfer(vt_1.clone());
        let vt2 = Transaction::ValueTransfer(vt_2);
        assert_ne!(vt1.hash(), vt2.hash());

        let dr1 = Transaction::DataRequest(dr_1.clone());
        let dr2 = Transaction::DataRequest(dr_2);
        assert_ne!(dr1.hash(), dr2.hash());

        let mut transactions_pool = TransactionsPool::default();
        transactions_pool.insert(vt1.clone(), 1);
        transactions_pool.insert(vt2.clone(), 1);
        let t = transactions_pool.vt_remove(&vt_1).unwrap();
        assert_eq!(Transaction::ValueTransfer(t), vt1);
        assert!(!transactions_pool.contains(&vt1).unwrap());
        assert!(transactions_pool.contains(&vt2).unwrap());

        let mut transactions_pool = TransactionsPool::default();
        transactions_pool.insert(vt1.clone(), 1);
        transactions_pool.insert(dr2.clone(), 1);
        let t = transactions_pool.vt_remove(&vt_1).unwrap();
        assert_eq!(Transaction::ValueTransfer(t), vt1);
        assert!(!transactions_pool.contains(&vt1).unwrap());
        assert!(transactions_pool.contains(&dr2).unwrap());

        let mut transactions_pool = TransactionsPool::default();
        transactions_pool.insert(dr1.clone(), 1);
        transactions_pool.insert(dr2.clone(), 1);
        let t = transactions_pool.dr_remove(&dr_1).unwrap();
        assert_eq!(Transaction::DataRequest(t), dr1);
        assert!(!transactions_pool.contains(&dr1).unwrap());
        assert!(transactions_pool.contains(&dr2).unwrap());

        let mut transactions_pool = TransactionsPool::default();
        transactions_pool.insert(dr1.clone(), 1);
        transactions_pool.insert(vt2.clone(), 1);
        let t = transactions_pool.dr_remove(&dr_1).unwrap();
        assert_eq!(Transaction::DataRequest(t), dr1);
        assert!(!transactions_pool.contains(&dr1).unwrap());
        assert!(transactions_pool.contains(&vt2).unwrap());
    }

    #[test]
    fn transactions_pool_clears_output_pointer_map_when_removing_unspendable_vt_transactions() {
        let input0 = Input::new(OutputPointer {
            transaction_id: Hash::default(),
            output_index: 0,
        });
        let input1 = Input::new(OutputPointer {
            transaction_id: Hash::default(),
            output_index: 1,
        });
        assert_ne!(input0, input1);

        let vt_1 = VTTransaction::new(VTTransactionBody::new(vec![input0], vec![]), vec![]);
        let vt_2 = VTTransaction::new(
            VTTransactionBody::new(vec![input0, input1], vec![ValueTransferOutput::default()]),
            vec![],
        );

        let vt1 = Transaction::ValueTransfer(vt_1.clone());
        let vt2 = Transaction::ValueTransfer(vt_2);
        assert_ne!(vt1.hash(), vt2.hash());

        let mut transactions_pool = TransactionsPool::default();
        transactions_pool.insert(vt1.clone(), 1);
        transactions_pool.insert(vt2.clone(), 1);
        // Removing vt1 should mark the inputs of vt1 as spent, so vt2 is now invalid and should be
        // removed
        let t = transactions_pool.vt_remove(&vt_1).unwrap();
        assert_eq!(Transaction::ValueTransfer(t), vt1);
        assert!(!transactions_pool.contains(&vt1).unwrap());
        assert!(!transactions_pool.contains(&vt2).unwrap());
        assert!(transactions_pool.sorted_vt_index.is_empty());
        assert!(transactions_pool.output_pointer_map.is_empty());
    }

    #[test]
    fn transactions_pool_clears_output_pointer_map_when_removing_unspendable_dr_transactions() {
        let input0 = Input::new(OutputPointer {
            transaction_id: Hash::default(),
            output_index: 0,
        });
        let input1 = Input::new(OutputPointer {
            transaction_id: Hash::default(),
            output_index: 1,
        });
        assert_ne!(input0, input1);

        let dr_1 = DRTransaction::new(
            DRTransactionBody::new(vec![input0], DataRequestOutput::default(), vec![]),
            vec![],
        );
        let dr_2 = DRTransaction::new(
            DRTransactionBody::new(vec![input0, input1], DataRequestOutput::default(), vec![]),
            vec![],
        );

        let dr1 = Transaction::DataRequest(dr_1.clone());
        let dr2 = Transaction::DataRequest(dr_2);
        assert_ne!(dr1.hash(), dr2.hash());

        let mut transactions_pool = TransactionsPool::default();
        transactions_pool.insert(dr1.clone(), 1);
        transactions_pool.insert(dr2.clone(), 1);
        // Removing dr1 should mark the inputs of dr1 as spent, so dr2 is now invalid and should be
        // removed
        let t = transactions_pool.dr_remove(&dr_1).unwrap();
        assert_eq!(Transaction::DataRequest(t), dr1);
        assert!(!transactions_pool.contains(&dr1).unwrap());
        assert!(!transactions_pool.contains(&dr2).unwrap());
        assert!(transactions_pool.sorted_dr_index.is_empty());
        assert!(transactions_pool.output_pointer_map.is_empty());
    }

    #[test]
    fn transactions_pool_malleability_vt() {
        let input = Input::default();
        let mut vt_1 = VTTransaction::new(
            VTTransactionBody::new(vec![input], vec![]),
            vec![KeyedSignature::default()],
        );
        // Add dummy signature, but pretend it is valid
        match &mut vt_1.signatures[0].signature {
            Signature::Secp256k1(sig) => sig.der = vec![0; 32],
        }

        let mut vt_2 = vt_1.clone();
        // Flip one bit in the signature, but pretend that the signature is still valid (malleability).
        match &mut vt_2.signatures[0].signature {
            Signature::Secp256k1(secp_sig) => {
                // Flip 1 bit
                secp_sig.der[10] ^= 0x01;
            }
        }

        let vt1 = Transaction::ValueTransfer(vt_1.clone());
        let vt2 = Transaction::ValueTransfer(vt_2.clone());
        assert_eq!(vt1.hash(), vt2.hash());
        assert_ne!(vt1, vt2);

        let mut transactions_pool = TransactionsPool::default();
        transactions_pool.insert(vt1.clone(), 1);
        transactions_pool.insert(vt2.clone(), 1);
        // Removing vt_1 actually returns vt_2, because they have the same hash, but this is fine
        // because they both have a valid signature
        let t = transactions_pool.vt_remove(&vt_1).unwrap();
        assert_eq!(Transaction::ValueTransfer(t), vt2);
        assert!(!transactions_pool.contains(&vt1).unwrap());
        assert!(!transactions_pool.contains(&vt2).unwrap());
    }

    #[test]
    fn transactions_pool_malleability_dr() {
        let input = Input::default();
        let mut dr_1 = DRTransaction::new(
            DRTransactionBody::new(vec![input], DataRequestOutput::default(), vec![]),
            vec![KeyedSignature::default()],
        );
        // Add dummy signature, but pretend it is valid
        match &mut dr_1.signatures[0].signature {
            Signature::Secp256k1(sig) => sig.der = vec![0; 32],
        }

        let mut dr_2 = dr_1.clone();
        // Flip one bit in the signature, but pretend that the signature is still valid (malleability).
        match &mut dr_2.signatures[0].signature {
            Signature::Secp256k1(secp_sig) => {
                // Flip 1 bit
                secp_sig.der[10] ^= 0x01;
            }
        }

        let dr1 = Transaction::DataRequest(dr_1.clone());
        let dr2 = Transaction::DataRequest(dr_2.clone());
        assert_eq!(dr1.hash(), dr2.hash());
        assert_ne!(dr1, dr2);

        let mut transactions_pool = TransactionsPool::default();
        transactions_pool.insert(dr1.clone(), 1);
        transactions_pool.insert(dr2.clone(), 1);
        // Removing dr_1 actually returns dr_2, because they have the same hash, but this is fine
        // because they both have a valid signature
        let t = transactions_pool.dr_remove(&dr_1).unwrap();
        assert_eq!(Transaction::DataRequest(t), dr2);
        assert!(!transactions_pool.contains(&dr1).unwrap());
        assert!(!transactions_pool.contains(&dr2).unwrap());
    }

    #[test]
    fn transactions_pool_malleability_co() {
        let c1 = Hash::SHA256([1; 32]);
        let mut t1 = Transaction::Commit(CommitTransaction {
            body: CommitTransactionBody::without_collateral(
                Default::default(),
                c1,
                Default::default(),
            ),
            signatures: vec![KeyedSignature::default()],
        });
        // Add dummy signature, but pretend it is valid
        match &mut t1 {
            Transaction::Commit(co1) => match &mut co1.signatures[0].signature {
                Signature::Secp256k1(sig) => sig.der = vec![0; 32],
            },
            _ => unreachable!(),
        }

        let mut t2 = t1.clone();
        // Flip one bit in the signature, but pretend that the signature is still valid (malleability).
        match &mut t2 {
            Transaction::Commit(co2) => {
                match &mut co2.signatures[0].signature {
                    Signature::Secp256k1(secp_sig) => {
                        // Flip 1 bit
                        secp_sig.der[10] ^= 0x01;
                    }
                }
            }
            _ => unreachable!(),
        }

        let mut transactions_pool = TransactionsPool::default();
        transactions_pool.insert(t1, 0);
        transactions_pool.insert(t2.clone(), 0);
        let mut expected = TransactionsPool::default();
        expected.insert(t2, 0);
        assert_eq!(transactions_pool.co_transactions, expected.co_transactions);
    }

    #[test]
    fn transactions_pool_malleability_re() {
        let r1 = vec![1];
        let mut t1 = Transaction::Reveal(RevealTransaction {
            body: RevealTransactionBody::new(Default::default(), r1, Default::default()),
            signatures: vec![KeyedSignature::default()],
        });
        // Add dummy signature, but pretend it is valid
        match &mut t1 {
            Transaction::Reveal(re1) => match &mut re1.signatures[0].signature {
                Signature::Secp256k1(sig) => sig.der = vec![0; 32],
            },
            _ => unreachable!(),
        }

        let mut t2 = t1.clone();
        // Flip one bit in the signature, but pretend that the signature is still valid (malleability).
        match &mut t2 {
            Transaction::Reveal(re2) => {
                match &mut re2.signatures[0].signature {
                    Signature::Secp256k1(secp_sig) => {
                        // Flip 1 bit
                        secp_sig.der[10] ^= 0x01;
                    }
                }
            }
            _ => unreachable!(),
        }

        let mut transactions_pool = TransactionsPool::default();
        transactions_pool.insert(t1, 0);
        transactions_pool.insert(t2.clone(), 0);
        let mut expected = TransactionsPool::default();
        expected.insert(t2, 0);
        assert_eq!(transactions_pool.re_transactions, expected.re_transactions);
    }

    #[test]
    fn transactions_pool_size_limit() {
        let input = Input::default();
        let vt1 = Transaction::ValueTransfer(VTTransaction::new(
            VTTransactionBody::new(vec![input], vec![ValueTransferOutput::default()]),
            vec![],
        ));
        let vt2 = Transaction::ValueTransfer(VTTransaction::new(
            VTTransactionBody::new(
                vec![input],
                vec![ValueTransferOutput {
                    pkh: Default::default(),
                    value: 1,
                    time_lock: 0,
                }],
            ),
            vec![],
        ));

        assert_ne!(vt1, vt2);

        let vt_size = |vt: &Transaction| match vt {
            Transaction::ValueTransfer(vt) => u64::from(vt.weight()),
            _ => unreachable!(),
        };

        let vt1_size = vt_size(&vt1);
        let vt2_size = vt_size(&vt2);
        assert_eq!(vt1_size, vt2_size);

        let mut transactions_pool = TransactionsPool::default();
        let _removed = transactions_pool.set_total_weight_limit(vt1_size, 1.0);
        let removed = transactions_pool.insert(vt1.clone(), 1);
        assert!(removed.is_empty());
        assert!(transactions_pool.contains(&vt1).unwrap());

        // Inserting a transaction with higher fee removes the older transaction
        let removed = transactions_pool.insert(vt2.clone(), 2);
        assert_eq!(removed, vec![vt1.clone()]);
        assert!(!transactions_pool.contains(&vt1).unwrap());
        assert!(transactions_pool.contains(&vt2).unwrap());
        let removed = transactions_pool.insert(vt1.clone(), 1);
        assert_eq!(removed, vec![vt1.clone()]);
        assert!(!transactions_pool.contains(&vt1).unwrap());
        assert!(transactions_pool.contains(&vt2).unwrap());

        // Decreasing the weight limit removes the transaction and makes it impossible to insert
        // any of this transactions
        let removed = transactions_pool.set_total_weight_limit(vt1_size - 1, 1.0);
        assert_eq!(removed, vec![vt2.clone()]);
        assert!(!transactions_pool.contains(&vt1).unwrap());
        assert!(!transactions_pool.contains(&vt2).unwrap());
        let removed = transactions_pool.insert(vt1.clone(), 1);
        assert_eq!(removed, vec![vt1.clone()]);
        assert!(!transactions_pool.contains(&vt1).unwrap());
        assert!(!transactions_pool.contains(&vt2).unwrap());
        let removed = transactions_pool.insert(vt2.clone(), 2);
        assert_eq!(removed, vec![vt2.clone()]);
        assert!(!transactions_pool.contains(&vt1).unwrap());
        assert!(!transactions_pool.contains(&vt2).unwrap());
    }

    #[allow(clippy::cast_precision_loss)]
    #[test]
    fn transactions_pool_size_limit_vt_to_dr_ratio() {
        // Check that the vt_to_dr_ratio works
        let gen_vt = |i| {
            Transaction::ValueTransfer(VTTransaction::new(
                VTTransactionBody::new(
                    vec![Input::default()],
                    vec![ValueTransferOutput {
                        pkh: Default::default(),
                        value: i,
                        time_lock: 0,
                    }],
                ),
                vec![],
            ))
        };

        let gen_dr = |i| {
            Transaction::DataRequest(DRTransaction::new(
                DRTransactionBody::new(
                    vec![Input::default()],
                    DataRequestOutput::default(),
                    vec![ValueTransferOutput {
                        pkh: Default::default(),
                        value: i,
                        time_lock: 0,
                    }],
                ),
                vec![],
            ))
        };

        let vt_size = |vt: &Transaction| match vt {
            Transaction::ValueTransfer(vt) => u64::from(vt.weight()),
            _ => unreachable!(),
        };

        let dr_size = |dr: &Transaction| match dr {
            Transaction::DataRequest(dr) => u64::from(dr.weight()),
            _ => unreachable!(),
        };

        // Generate 10 value transfer transactions and 10 data request transactions
        let vts: Vec<_> = (0..10).map(gen_vt).collect();
        let drs: Vec<_> = (0..10).map(gen_dr).collect();

        let one_vt_size = vt_size(&vts[0]);
        let one_dr_size = dr_size(&drs[0]);

        // Set the weight limit to be enough to hold 100 transactions of each kind
        let weight_limit = (one_vt_size + one_dr_size) * 100;
        let vt_to_dr_factor = one_vt_size as f64 / one_dr_size as f64;
        let mut transactions_pool = TransactionsPool::default();
        let _removed = transactions_pool.set_total_weight_limit(weight_limit, vt_to_dr_factor);

        // Insert 10 transactions of each kind
        for (i, vt) in vts.iter().enumerate() {
            let removed = transactions_pool.insert(vt.clone(), u64::try_from(i).unwrap());
            assert!(removed.is_empty());
            assert!(transactions_pool.contains(vt).unwrap());
        }
        for (i, dr) in drs.iter().enumerate() {
            let removed = transactions_pool.insert(dr.clone(), u64::try_from(i).unwrap());
            assert!(removed.is_empty());
            assert!(transactions_pool.contains(dr).unwrap());
        }

        // Backup for later
        let transactions_pool2 = transactions_pool.clone();

        // Set the weight limit to be enough to hold only 5 transactions of each kind
        let weight_limit = (one_vt_size + one_dr_size) * 5;
        // But set the ratio to 1000:1, so all the dr transactions should be removed
        let vt_to_dr_factor = 1000.0;
        let removed = transactions_pool.set_total_weight_limit(weight_limit, vt_to_dr_factor);
        assert!(
            (transactions_pool.total_vt_weight as f64)
                >= (transactions_pool.total_dr_weight as f64 * vt_to_dr_factor)
        );
        let mut removed_dr_count = 0;
        for tx in &removed {
            if let Transaction::DataRequest(_drt) = tx {
                removed_dr_count += 1
            }
        }
        assert!(removed.len() < 20);
        if removed.len() <= 10 {
            // Assert that all the removed transactions are DRTs
            assert_eq!(removed_dr_count, removed.len());
        } else {
            // Assert there are exactly 10 removed DRTs
            assert_eq!(removed_dr_count, 10);
        }

        transactions_pool = transactions_pool2;
        // Set the weight limit to be enough to hold only 5 transactions of each kind
        let weight_limit = (one_vt_size + one_dr_size) * 5;
        // But set the ratio to 1:1000, so all the vt transactions should be removed
        let vt_to_dr_factor = 1.0 / 1000.0;
        let removed = transactions_pool.set_total_weight_limit(weight_limit, vt_to_dr_factor);
        assert!(
            (transactions_pool.total_vt_weight as f64)
                >= (transactions_pool.total_dr_weight as f64 * vt_to_dr_factor)
        );
        let mut removed_vt_count = 0;
        for tx in &removed {
            if let Transaction::ValueTransfer(_vtt) = tx {
                removed_vt_count += 1
            }
        }
        assert!(removed.len() < 20);
        if removed.len() <= 10 {
            // Assert that all the removed transactions are VTTs
            assert_eq!(removed_vt_count, removed.len());
        } else {
            // Assert there are exactly 10 removed VTTs
            assert_eq!(removed_vt_count, 10);
        }
    }

    #[test]
    fn transactions_pool_minimum_vtt_fee() {
        let input = Input::default();
        let vt1 = Transaction::ValueTransfer(VTTransaction::new(
            VTTransactionBody::new(vec![input], vec![ValueTransferOutput::default()]),
            vec![],
        ));

        let mut transactions_pool = TransactionsPool::default();
        transactions_pool.set_minimum_vtt_fee(1);

        // Inserting a transaction with a fee lower than `minimum_vtt_fee` results in the transaction not being added
        let removed = transactions_pool.insert(vt1.clone(), 0);
        assert_eq!(removed, vec![vt1.clone()]);
        assert!(!transactions_pool.contains(&vt1).unwrap());
        // Inserting a transaction with a fee higher than `minimum_vtt_fee` results in the transaction being added
        let removed = transactions_pool.insert(vt1.clone(), 1);
        assert_eq!(removed, vec![]);
        assert!(transactions_pool.contains(&vt1).unwrap());
    }

    #[test]
    fn transactions_pool_contains_commit_same_pkh() {
        let c1 = Hash::SHA256([1; 32]);
        let c2 = Hash::SHA256([2; 32]);
        let t1 = Transaction::Commit(CommitTransaction {
            body: CommitTransactionBody::without_collateral(
                Default::default(),
                c1,
                Default::default(),
            ),
            signatures: vec![KeyedSignature::default()],
        });
        let t2 = Transaction::Commit(CommitTransaction {
            body: CommitTransactionBody::without_collateral(
                Default::default(),
                c2,
                Default::default(),
            ),
            signatures: vec![KeyedSignature::default()],
        });
        let mut transactions_pool = TransactionsPool::default();
        assert_eq!(transactions_pool.contains(&t1), Ok(false));
        transactions_pool.insert(t1.clone(), 0);
        assert_eq!(transactions_pool.contains(&t1), Ok(true));
        assert_eq!(
            transactions_pool.contains(&t2),
            Err(TransactionError::DuplicatedCommit {
                pkh: PublicKey::default().pkh(),
                dr_pointer: Hash::default(),
            })
        );
        transactions_pool.insert(t2.clone(), 0);
        assert_eq!(transactions_pool.contains(&t2), Ok(true));
        // Check that insert overwrites
        let mut expected = TransactionsPool::default();
        expected.insert(t2, 0);
        assert_eq!(transactions_pool.co_transactions, expected.co_transactions);
    }

    #[test]
    fn transactions_pool_contains_reveal_same_pkh() {
        let r1 = vec![1];
        let r2 = vec![2];
        let t1 = Transaction::Reveal(RevealTransaction {
            body: RevealTransactionBody::new(Default::default(), r1, Default::default()),
            signatures: vec![KeyedSignature::default()],
        });
        let t2 = Transaction::Reveal(RevealTransaction {
            body: RevealTransactionBody::new(Default::default(), r2, Default::default()),
            signatures: vec![KeyedSignature::default()],
        });
        let mut transactions_pool = TransactionsPool::default();
        assert_eq!(transactions_pool.contains(&t1), Ok(false));
        transactions_pool.insert(t1.clone(), 0);
        assert_eq!(transactions_pool.contains(&t1), Ok(true));
        assert_eq!(
            transactions_pool.contains(&t2),
            Err(TransactionError::DuplicatedReveal {
                pkh: Default::default(),
                dr_pointer: Hash::default(),
            })
        );
        transactions_pool.insert(t2.clone(), 0);
        assert_eq!(transactions_pool.contains(&t2), Ok(true));
    }

    #[test]
    fn transactions_pool_insert_commit_overwrites() {
        let c1 = Hash::SHA256([1; 32]);
        let c2 = Hash::SHA256([2; 32]);
        let t1 = Transaction::Commit(CommitTransaction {
            body: CommitTransactionBody::without_collateral(
                Default::default(),
                c1,
                Default::default(),
            ),
            signatures: vec![KeyedSignature::default()],
        });
        let t2 = Transaction::Commit(CommitTransaction {
            body: CommitTransactionBody::without_collateral(
                Default::default(),
                c2,
                Default::default(),
            ),
            signatures: vec![KeyedSignature::default()],
        });
        let mut transactions_pool = TransactionsPool::default();
        transactions_pool.insert(t1, 0);
        transactions_pool.insert(t2.clone(), 0);
        let mut expected = TransactionsPool::default();
        expected.insert(t2, 0);
        assert_eq!(transactions_pool.co_transactions, expected.co_transactions);
    }

    #[test]
    fn transactions_pool_insert_reveal_overwrites() {
        let r1 = vec![1];
        let r2 = vec![2];
        let t1 = Transaction::Reveal(RevealTransaction {
            body: RevealTransactionBody::new(Default::default(), r1, Default::default()),
            signatures: vec![KeyedSignature::default()],
        });
        let t2 = Transaction::Reveal(RevealTransaction {
            body: RevealTransactionBody::new(Default::default(), r2, Default::default()),
            signatures: vec![KeyedSignature::default()],
        });

        let mut transactions_pool = TransactionsPool::default();
        transactions_pool.insert(t1, 0);
        transactions_pool.insert(t2.clone(), 0);
        let mut expected = TransactionsPool::default();
        expected.insert(t2, 0);
        assert_eq!(transactions_pool.re_transactions, expected.re_transactions);
    }

    #[test]
    fn transactions_pool_commits_are_cleared_on_remove() {
        let public_key = PublicKey::default();

        let dro = DataRequestOutput {
            witnesses: 1,
            ..Default::default()
        };
        let drb = DRTransactionBody::new(vec![], dro, vec![]);
        let drt = DRTransaction::new(
            drb,
            vec![KeyedSignature {
                signature: Default::default(),
                public_key,
            }],
        );
        let dr_pointer = drt.hash();
        let mut dr_pool = DataRequestPool::default();
        dr_pool.add_data_request(0, drt, None).unwrap();

        let c1 = Hash::SHA256([1; 32]);
        let t1 = Transaction::Commit(CommitTransaction {
            body: CommitTransactionBody::without_collateral(dr_pointer, c1, Default::default()),
            signatures: vec![KeyedSignature::default()],
        });
        let mut transactions_pool = TransactionsPool::default();
        transactions_pool.insert(t1, 0);
        assert_eq!(transactions_pool.co_transactions.len(), 1);
        assert_eq!(transactions_pool.co_hash_index.len(), 1);
        let (commits_vec, _commit_fees, _) = transactions_pool.remove_commits(&dr_pool);
        assert_eq!(commits_vec.len(), 1);
        assert_eq!(transactions_pool.co_transactions, HashMap::new());
        assert_eq!(transactions_pool.co_hash_index, HashMap::new());
    }

    #[test]
    fn transactions_pool_return_only_with_different_inputs() {
        let public_key = PublicKey::default();

        let dro1 = DataRequestOutput {
            witnesses: 1,
            commit_and_reveal_fee: 501,
            ..Default::default()
        };
        let drb1 = DRTransactionBody::new(vec![], dro1, vec![]);
        let drt1 = DRTransaction::new(
            drb1,
            vec![KeyedSignature {
                signature: Default::default(),
                public_key: public_key.clone(),
            }],
        );
        let dr_pointer1 = drt1.hash();

        let dro2 = DataRequestOutput {
            witnesses: 1,
            commit_and_reveal_fee: 100,
            ..Default::default()
        };
        let drb2 = DRTransactionBody::new(vec![], dro2, vec![]);
        let drt2 = DRTransaction::new(
            drb2,
            vec![KeyedSignature {
                signature: Default::default(),
                public_key: public_key.clone(),
            }],
        );
        let dr_pointer2 = drt2.hash();

        let dro3 = DataRequestOutput {
            witnesses: 1,
            commit_and_reveal_fee: 500,
            ..Default::default()
        };
        let drb3 = DRTransactionBody::new(vec![], dro3, vec![]);
        let drt3 = DRTransaction::new(
            drb3,
            vec![KeyedSignature {
                signature: Default::default(),
                public_key,
            }],
        );
        let dr_pointer3 = drt3.hash();

        let mut dr_pool = DataRequestPool::default();
        dr_pool.add_data_request(0, drt1, None).unwrap();
        dr_pool.add_data_request(0, drt2, None).unwrap();
        dr_pool.add_data_request(0, drt3, None).unwrap();

        let mut cb1 = CommitTransactionBody::without_collateral(
            dr_pointer1,
            Hash::SHA256([1; 32]),
            Default::default(),
        );
        cb1.collateral = vec![Input::default()];
        let c1 = CommitTransaction {
            body: cb1,
            signatures: vec![KeyedSignature::default()],
        };
        let t1 = Transaction::Commit(c1.clone());

        let mut cb2 = CommitTransactionBody::without_collateral(
            dr_pointer2,
            Hash::SHA256([2; 32]),
            Default::default(),
        );
        cb2.collateral = vec![Input {
            output_pointer: OutputPointer {
                transaction_id: Default::default(),
                output_index: 2,
            },
        }];
        let c2 = CommitTransaction {
            body: cb2,
            signatures: vec![KeyedSignature::default()],
        };
        let t2 = Transaction::Commit(c2.clone());

        // Commitment with same Input
        let mut cb3 = CommitTransactionBody::without_collateral(
            dr_pointer3,
            Hash::SHA256([3; 32]),
            Default::default(),
        );
        cb3.collateral = vec![Input::default()];
        let c3 = CommitTransaction {
            body: cb3,
            signatures: vec![KeyedSignature::default()],
        };
        let t3 = Transaction::Commit(c3.clone());

        let mut transactions_pool = TransactionsPool::default();
        transactions_pool.insert(t1, 0);
        assert_eq!(transactions_pool.co_transactions.len(), 1);
        assert_eq!(transactions_pool.co_hash_index.len(), 1);
        transactions_pool.insert(t2, 0);
        assert_eq!(transactions_pool.co_transactions.len(), 2);
        assert_eq!(transactions_pool.co_hash_index.len(), 2);
        transactions_pool.insert(t3, 0);
        assert_eq!(transactions_pool.co_transactions.len(), 3);
        assert_eq!(transactions_pool.co_hash_index.len(), 3);

        let (commits_vec, _commit_fees, _) = transactions_pool.remove_commits(&dr_pool);
        assert_eq!(commits_vec.len(), 2);
        // t2 does not conflict with anything so it must be present
        assert!(commits_vec.contains(&c2));
        // One of t1 or t3 must be present, but not both
        assert!(commits_vec.contains(&c1) ^ commits_vec.contains(&c3));
        assert_eq!(transactions_pool.co_transactions, HashMap::new());
        assert_eq!(transactions_pool.co_hash_index, HashMap::new());
    }

    #[test]
    fn transactions_pool_commits_are_cleared_on_remove_even_if_they_are_not_returned() {
        let public_key = PublicKey::default();

        let dro = DataRequestOutput {
            witnesses: 2,
            ..Default::default()
        };
        let drb = DRTransactionBody::new(vec![], dro, vec![]);
        let drt = DRTransaction::new(
            drb,
            vec![KeyedSignature {
                signature: Default::default(),
                public_key,
            }],
        );
        let dr_pointer = drt.hash();
        let mut dr_pool = DataRequestPool::default();
        dr_pool.add_data_request(0, drt, None).unwrap();

        let c1 = Hash::SHA256([1; 32]);
        let t1 = Transaction::Commit(CommitTransaction {
            body: CommitTransactionBody::without_collateral(dr_pointer, c1, Default::default()),
            signatures: vec![KeyedSignature::default()],
        });
        let mut transactions_pool = TransactionsPool::default();
        transactions_pool.insert(t1, 0);
        assert_eq!(transactions_pool.co_transactions.len(), 1);
        assert_eq!(transactions_pool.co_hash_index.len(), 1);
        let (commits_vec, _commit_fees, _) = transactions_pool.remove_commits(&dr_pool);
        // Since the number of commits is below the minimum of 1 witness specified in the `dro`,
        // remove_commits returns an empty vector
        assert_eq!(commits_vec, vec![]);
        // But the internal maps are cleared anyway, so the commit we inserted no longer exists
        assert_eq!(transactions_pool.co_transactions, HashMap::new());
        assert_eq!(transactions_pool.co_hash_index, HashMap::new());
    }

    #[test]
    fn transactions_pool_reveals_are_not_cleared_on_remove() {
        let public_key = PublicKey::default();

        let dro = DataRequestOutput {
            witnesses: 1,
            ..Default::default()
        };
        let drb = DRTransactionBody::new(vec![], dro, vec![]);
        let drt = DRTransaction::new(
            drb,
            vec![KeyedSignature {
                signature: Default::default(),
                public_key,
            }],
        );
        let dr_pointer = drt.hash();
        let mut dr_pool = DataRequestPool::default();
        dr_pool.add_data_request(0, drt, None).unwrap();

        let r1 = vec![1];
        let t1 = Transaction::Reveal(RevealTransaction {
            body: RevealTransactionBody::new(dr_pointer, r1, Default::default()),
            signatures: vec![KeyedSignature::default()],
        });
        let mut transactions_pool = TransactionsPool::default();
        transactions_pool.insert(t1, 0);
        assert_eq!(transactions_pool.re_transactions.len(), 1);
        assert_eq!(transactions_pool.re_hash_index.len(), 1);

        // get_reveals returns all the reveals, and they are not removed from the transactions pool
        let (reveals_vec, _reveal_fees) = transactions_pool.get_reveals(&dr_pool);
        assert_eq!(reveals_vec.len(), 1);
        assert_eq!(transactions_pool.re_transactions.len(), 1);
        assert_eq!(transactions_pool.re_hash_index.len(), 1);
    }

    #[test]
    fn transactions_pool_reveals_are_cleared_when_dr_finishes() {
        let public_key = PublicKey::default();

        let dro = DataRequestOutput {
            witnesses: 1,
            ..Default::default()
        };
        let drb = DRTransactionBody::new(vec![], dro, vec![]);
        let drt = DRTransaction::new(
            drb,
            vec![KeyedSignature {
                signature: Default::default(),
                public_key,
            }],
        );
        let dr_pointer = drt.hash();
        let mut dr_pool = DataRequestPool::default();
        dr_pool.add_data_request(0, drt, None).unwrap();

        let r1 = vec![1];
        let t1 = Transaction::Reveal(RevealTransaction {
            body: RevealTransactionBody::new(dr_pointer, r1, Default::default()),
            signatures: vec![KeyedSignature::default()],
        });
        let mut transactions_pool = TransactionsPool::default();
        transactions_pool.insert(t1, 0);
        assert_eq!(transactions_pool.re_transactions.len(), 1);
        assert_eq!(transactions_pool.re_hash_index.len(), 1);

        // After the data request finishes, the reveals will be removed from the transactions pool
        transactions_pool.clear_reveals_from_finished_dr(&dr_pointer);
        assert_eq!(transactions_pool.re_transactions, HashMap::new());
        assert_eq!(transactions_pool.re_hash_index, HashMap::new());
    }

    #[test]
    fn transactions_pool_reveals_are_always_returned() {
        let public_key = PublicKey::default();

        let dro = DataRequestOutput {
            witnesses: 2,
            ..Default::default()
        };
        let drb = DRTransactionBody::new(vec![], dro, vec![]);
        let drt = DRTransaction::new(
            drb,
            vec![KeyedSignature {
                signature: Default::default(),
                public_key,
            }],
        );
        let dr_pointer = drt.hash();
        let mut dr_pool = DataRequestPool::default();
        dr_pool.add_data_request(0, drt, None).unwrap();

        let r1 = vec![1];
        let t1 = Transaction::Reveal(RevealTransaction {
            body: RevealTransactionBody::new(dr_pointer, r1, Default::default()),
            signatures: vec![KeyedSignature::default()],
        });
        let mut transactions_pool = TransactionsPool::default();
        transactions_pool.insert(t1, 0);
        assert_eq!(transactions_pool.re_transactions.len(), 1);
        assert_eq!(transactions_pool.re_hash_index.len(), 1);
        let (reveals_vec, _reveal_fees) = transactions_pool.get_reveals(&dr_pool);
        // Even though the data request asks for 2 witnesses, it returns the 1 reveal that we have
        assert_eq!(reveals_vec.len(), 1);
        assert_eq!(transactions_pool.re_transactions.len(), 1);
        assert_eq!(transactions_pool.re_hash_index.len(), 1);
    }

    #[test]
    fn transactions_pool_reveals_can_be_removed_one_by_one() {
        let public_key = PublicKey::default();

        let dro = DataRequestOutput {
            witnesses: 2,
            ..Default::default()
        };
        let drb = DRTransactionBody::new(vec![], dro, vec![]);
        let drt = DRTransaction::new(
            drb,
            vec![KeyedSignature {
                signature: Default::default(),
                public_key,
            }],
        );
        let dr_pointer = drt.hash();
        let mut dr_pool = DataRequestPool::default();
        dr_pool.add_data_request(0, drt, None).unwrap();

        let r1 = vec![1];
        let re_tx = RevealTransaction {
            body: RevealTransactionBody::new(dr_pointer, r1, Default::default()),
            signatures: vec![KeyedSignature::default()],
        };
        let t1 = Transaction::Reveal(re_tx.clone());
        let mut transactions_pool = TransactionsPool::default();
        transactions_pool.insert(t1, 0);
        assert_eq!(transactions_pool.re_transactions.len(), 1);
        assert_eq!(transactions_pool.re_hash_index.len(), 1);
        let (reveals_vec, _reveal_fees) = transactions_pool.get_reveals(&dr_pool);
        // Even though the data request asks for 2 witnesses, it returns the 1 reveal that we have
        assert_eq!(reveals_vec.len(), 1);
        assert_eq!(transactions_pool.re_transactions.len(), 1);
        assert_eq!(
            transactions_pool
                .re_transactions
                .values()
                .next()
                .unwrap()
                .len(),
            1
        );
        assert_eq!(transactions_pool.re_hash_index.len(), 1);

        // Now, a different reveal is inserted
        let r2 = vec![1];
        let re_pkh2 = PublicKeyHash::from_bytes(&[0x01; 20]).unwrap();
        let re_tx2 = RevealTransaction {
            body: RevealTransactionBody::new(dr_pointer, r2, re_pkh2),
            signatures: vec![KeyedSignature::default()],
        };
        let t2 = Transaction::Reveal(re_tx2.clone());
        transactions_pool.insert(t2, 0);
        assert_eq!(transactions_pool.re_transactions.len(), 1);
        assert_eq!(
            transactions_pool
                .re_transactions
                .values()
                .next()
                .unwrap()
                .len(),
            2
        );
        assert_eq!(transactions_pool.re_hash_index.len(), 2);

        // After this reveal is consolidated in a block, it will be removed:
        let same_as_re_tx = transactions_pool.remove_one_reveal(
            &re_tx.body.dr_pointer,
            &re_tx.body.pkh,
            &re_tx.hash(),
        );
        assert_eq!(same_as_re_tx, Some(re_tx));
        assert_eq!(transactions_pool.re_transactions.len(), 1);
        assert_eq!(
            transactions_pool
                .re_transactions
                .values()
                .next()
                .unwrap()
                .len(),
            1
        );
        assert_eq!(transactions_pool.re_hash_index.len(), 1);

        // And the second reveal will also be removed:
        let same_as_re_tx2 = transactions_pool.remove_one_reveal(
            &re_tx2.body.dr_pointer,
            &re_tx2.body.pkh,
            &re_tx2.hash(),
        );
        assert_eq!(same_as_re_tx2, Some(re_tx2));
        assert_eq!(transactions_pool.re_transactions, HashMap::new());
        assert_eq!(transactions_pool.re_hash_index, HashMap::new());

        // After the data request finishes, the reveals will be removed from the transactions pool
        transactions_pool.clear_reveals_from_finished_dr(&dr_pointer);
        assert_eq!(transactions_pool.re_transactions, HashMap::new());
        assert_eq!(transactions_pool.re_hash_index, HashMap::new());
    }

    #[test]
    fn rep_threshold_zero() {
        let rep_engine = ReputationEngine::new(1000);

        assert_eq!(rep_engine.threshold_factor(1), u32::MAX);
    }

    #[test]
    fn rep_threshold_1() {
        let mut rep_engine = ReputationEngine::new(1000);
        let id1 = PublicKeyHash { hash: [1; 20] };

        rep_engine
            .trs_mut()
            .gain(Alpha(10), vec![(id1, Reputation(99))])
            .unwrap();
        rep_engine.ars_mut().push_activity(vec![id1]);

        assert_eq!(rep_engine.threshold_factor(1), 1);
    }

    #[test]
    fn rep_threshold_2() {
        let mut rep_engine = ReputationEngine::new(1000);
        let id1 = PublicKeyHash { hash: [1; 20] };
        let id2 = PublicKeyHash { hash: [2; 20] };

        rep_engine
            .trs_mut()
            .gain(Alpha(10), vec![(id1, Reputation(99))])
            .unwrap();
        rep_engine.ars_mut().push_activity(vec![id1]);

        rep_engine
            .trs_mut()
            .gain(Alpha(10), vec![(id2, Reputation(49))])
            .unwrap();
        rep_engine.ars_mut().push_activity(vec![id2]);

        assert_eq!(rep_engine.threshold_factor(1), 1);
        assert_eq!(rep_engine.threshold_factor(2), 3);
    }

    #[test]
    fn rep_threshold_2_inverse() {
        let mut rep_engine = ReputationEngine::new(1000);
        let id1 = PublicKeyHash { hash: [1; 20] };
        let id2 = PublicKeyHash { hash: [2; 20] };

        rep_engine
            .trs_mut()
            .gain(Alpha(10), vec![(id1, Reputation(49))])
            .unwrap();
        rep_engine.ars_mut().push_activity(vec![id1]);

        rep_engine
            .trs_mut()
            .gain(Alpha(10), vec![(id2, Reputation(99))])
            .unwrap();
        rep_engine.ars_mut().push_activity(vec![id2]);

        assert_eq!(rep_engine.threshold_factor(1), 1);
        assert_eq!(rep_engine.threshold_factor(2), 3);
    }

    #[test]
    fn rep_threshold_2_sum() {
        let mut rep_engine = ReputationEngine::new(1000);
        let id1 = PublicKeyHash { hash: [1; 20] };
        let id2 = PublicKeyHash { hash: [2; 20] };

        rep_engine
            .trs_mut()
            .gain(Alpha(10), vec![(id1, Reputation(49))])
            .unwrap();
        rep_engine.ars.push_activity(vec![id1]);

        rep_engine
            .trs_mut()
            .gain(Alpha(10), vec![(id2, Reputation(99))])
            .unwrap();
        rep_engine.ars_mut().push_activity(vec![id2]);

        rep_engine
            .trs_mut()
            .gain(Alpha(10), vec![(id1, Reputation(200))])
            .unwrap();

        assert_eq!(rep_engine.threshold_factor(1), 1);
        assert_eq!(rep_engine.threshold_factor(2), 3);
    }

    #[test]
    fn rep_threshold_2_more_than_actives() {
        let mut rep_engine = ReputationEngine::new(1000);
        let id1 = PublicKeyHash { hash: [1; 20] };
        let id2 = PublicKeyHash { hash: [2; 20] };

        rep_engine
            .trs_mut()
            .gain(Alpha(10), vec![(id1, Reputation(49))])
            .unwrap();
        rep_engine.ars_mut().push_activity(vec![id1]);

        rep_engine
            .trs_mut()
            .gain(Alpha(10), vec![(id2, Reputation(99))])
            .unwrap();
        rep_engine.ars_mut().push_activity(vec![id2]);

        assert_eq!(rep_engine.threshold_factor(10), u32::MAX);
    }

    #[test]
    fn rep_threshold_2_zero_requested() {
        let mut rep_engine = ReputationEngine::new(1000);
        let id1 = PublicKeyHash { hash: [1; 20] };
        let id2 = PublicKeyHash { hash: [2; 20] };

        rep_engine
            .trs_mut()
            .gain(Alpha(10), vec![(id1, Reputation(49))])
            .unwrap();
        rep_engine.ars_mut().push_activity(vec![id1]);

        rep_engine
            .trs_mut()
            .gain(Alpha(10), vec![(id2, Reputation(99))])
            .unwrap();
        rep_engine.ars_mut().push_activity(vec![id2]);

        assert_eq!(rep_engine.threshold_factor(0), 0);
    }

    #[test]
    fn rep_threshold_specific_example() {
        let mut rep_engine = ReputationEngine::new(1000);
        let mut ids = vec![];
        for i in 0..8 {
            ids.push(PublicKeyHash::from_bytes(&[i; 20]).unwrap());
        }
        rep_engine.ars_mut().push_activity(ids.clone());

        rep_engine
            .trs_mut()
            .gain(Alpha(10), vec![(ids[0], Reputation(79))])
            .unwrap();
        rep_engine
            .trs_mut()
            .gain(Alpha(10), vec![(ids[1], Reputation(9))])
            .unwrap();
        rep_engine
            .trs_mut()
            .gain(Alpha(10), vec![(ids[2], Reputation(1))])
            .unwrap();
        rep_engine
            .trs
            .gain(Alpha(10), vec![(ids[3], Reputation(1))])
            .unwrap();
        rep_engine
            .trs_mut()
            .gain(Alpha(10), vec![(ids[4], Reputation(1))])
            .unwrap();
        rep_engine
            .trs_mut()
            .gain(Alpha(10), vec![(ids[5], Reputation(1))])
            .unwrap();

        assert_eq!(rep_engine.threshold_factor(0), 0);
        assert_eq!(rep_engine.threshold_factor(1), 1);
        assert_eq!(rep_engine.threshold_factor(2), 2);
        assert_eq!(rep_engine.threshold_factor(3), 3);
        assert_eq!(rep_engine.threshold_factor(4), 5);
        assert_eq!(rep_engine.threshold_factor(5), 7);
        assert_eq!(rep_engine.threshold_factor(6), 15);
        assert_eq!(rep_engine.threshold_factor(7), 50);
        assert_eq!(rep_engine.threshold_factor(8), 100);
        assert_eq!(rep_engine.threshold_factor(9), u32::MAX);
    }

    #[test]
    fn test_calculate_backup_witnesses() {
        assert_eq!(calculate_backup_witnesses(10, 1), 5);
        assert_eq!(calculate_backup_witnesses(10, 2), 10);
        assert_eq!(calculate_backup_witnesses(10, 3), 20);
        assert_eq!(calculate_backup_witnesses(10, 4), 40);

        assert_eq!(calculate_backup_witnesses(11, 1), 5);
        assert_eq!(calculate_backup_witnesses(11, 2), 11);
        assert_eq!(calculate_backup_witnesses(11, 3), 22);
        assert_eq!(calculate_backup_witnesses(11, 4), 44);
    }

    #[test]
    fn test_ordered_alts_no_tie() {
        let mut alt_keys = AltKeys::default();

        let p1 = PublicKeyHash::from_bytes(&[0x01; 20]).unwrap();
        let p2 = PublicKeyHash::from_bytes(&[0x02; 20]).unwrap();
        let p3 = PublicKeyHash::from_bytes(&[0x03; 20]).unwrap();

        let p1_bls =
            Bn256PublicKey::from_secret_key(&Bn256SecretKey::from_slice(&[1; 32]).unwrap())
                .unwrap();

        let p2_bls =
            Bn256PublicKey::from_secret_key(&Bn256SecretKey::from_slice(&[2; 32]).unwrap())
                .unwrap();

        let p3_bls =
            Bn256PublicKey::from_secret_key(&Bn256SecretKey::from_slice(&[3; 32]).unwrap())
                .unwrap();

        alt_keys.insert_bn256(p1, p1_bls.clone());
        alt_keys.insert_bn256(p2, p2_bls.clone());
        alt_keys.insert_bn256(p3, p3_bls.clone());

        let v4 = vec![
            (p1, Reputation(3)),
            (p2, Reputation(2)),
            (p3, Reputation(1)),
        ];

        let mut rep_engine = ReputationEngine::new(100);
        rep_engine.trs_mut().gain(Alpha(4), v4).unwrap();
        rep_engine.ars_mut().push_activity(vec![p1, p2, p3]);

        let expected_order = vec![p1_bls, p2_bls, p3_bls];
        let ordered_identities = rep_engine.get_rep_ordered_ars_list();
        let ars_identities = ARSIdentities::new(ordered_identities);

        assert_eq!(
            expected_order,
            ars_identities.get_rep_ordered_bn256_list(&alt_keys)
        );
    }

    #[test]
    fn test_ordered_alts_with_tie() {
        let mut alt_keys = AltKeys::default();

        let p1 = PublicKeyHash::from_bytes(&[0x01; 20]).unwrap();
        let p2 = PublicKeyHash::from_bytes(&[0x02; 20]).unwrap();
        let p3 = PublicKeyHash::from_bytes(&[0x03; 20]).unwrap();

        let p1_bls =
            Bn256PublicKey::from_secret_key(&Bn256SecretKey::from_slice(&[1; 32]).unwrap())
                .unwrap();
        let p2_bls =
            Bn256PublicKey::from_secret_key(&Bn256SecretKey::from_slice(&[2; 32]).unwrap())
                .unwrap();
        let p3_bls =
            Bn256PublicKey::from_secret_key(&Bn256SecretKey::from_slice(&[3; 32]).unwrap())
                .unwrap();

        alt_keys.insert_bn256(p1, p1_bls.clone());
        alt_keys.insert_bn256(p2, p2_bls.clone());
        alt_keys.insert_bn256(p3, p3_bls.clone());

        let v4 = vec![
            (p1, Reputation(3)),
            (p2, Reputation(1)),
            (p3, Reputation(1)),
        ];

        let mut rep_engine = ReputationEngine::new(100);
        rep_engine.trs_mut().gain(Alpha(4), v4).unwrap();
        rep_engine.ars_mut().push_activity(vec![p1, p2, p3]);

        let expected_order = vec![p1_bls, p2_bls, p3_bls];
        let ordered_identities = rep_engine.get_rep_ordered_ars_list();
        let ars_identities = ARSIdentities::new(ordered_identities);

        assert_eq!(
            expected_order,
            ars_identities.get_rep_ordered_bn256_list(&alt_keys)
        );
    }

    #[test]
    fn test_ordered_alts_with_tie_2() {
        let mut alt_keys = AltKeys::default();

        let p1 = PublicKeyHash::from_bytes(&[0x01; 20]).unwrap();
        let p2 = PublicKeyHash::from_bytes(&[0x02; 20]).unwrap();
        let p3 = PublicKeyHash::from_bytes(&[0x03; 20]).unwrap();
        let p4 = PublicKeyHash::from_bytes(&[0x04; 20]).unwrap();
        let p5 = PublicKeyHash::from_bytes(&[0x05; 20]).unwrap();

        let p1_bls =
            Bn256PublicKey::from_secret_key(&Bn256SecretKey::from_slice(&[1; 32]).unwrap())
                .unwrap();

        let p2_bls =
            Bn256PublicKey::from_secret_key(&Bn256SecretKey::from_slice(&[2; 32]).unwrap())
                .unwrap();

        let p3_bls =
            Bn256PublicKey::from_secret_key(&Bn256SecretKey::from_slice(&[3; 32]).unwrap())
                .unwrap();

        let p4_bls =
            Bn256PublicKey::from_secret_key(&Bn256SecretKey::from_slice(&[4; 32]).unwrap())
                .unwrap();

        let p5_bls =
            Bn256PublicKey::from_secret_key(&Bn256SecretKey::from_slice(&[5; 32]).unwrap())
                .unwrap();

        alt_keys.insert_bn256(p1, p1_bls.clone());
        alt_keys.insert_bn256(p2, p2_bls.clone());
        alt_keys.insert_bn256(p3, p3_bls.clone());
        alt_keys.insert_bn256(p4, p4_bls.clone());
        alt_keys.insert_bn256(p5, p5_bls.clone());

        let v4 = vec![
            (p1, Reputation(3)),
            (p2, Reputation(1)),
            (p3, Reputation(1)),
            (p4, Reputation(1)),
            (p5, Reputation(1)),
        ];

        let mut rep_engine = ReputationEngine::new(100);
        rep_engine.trs_mut().gain(Alpha(4), v4).unwrap();
        rep_engine.ars_mut().push_activity(vec![p1, p2, p3, p4, p5]);

        let expected_order = vec![p1_bls, p2_bls, p4_bls, p5_bls, p3_bls];
        let ordered_identities = rep_engine.get_rep_ordered_ars_list();
        let ars_identities = ARSIdentities::new(ordered_identities);

        assert_eq!(
            expected_order,
            ars_identities.get_rep_ordered_bn256_list(&alt_keys)
        );
    }

    #[test]
    fn test_is_valid_true() {
        let bls_pk =
            Bn256PublicKey::from_secret_key(&Bn256SecretKey::from_slice(&[3; 32]).unwrap())
                .unwrap();
        assert!(bls_pk.is_valid());
    }

    #[test]
    fn test_is_valid_false_invalid_length() {
        let bls_pk =
            Bn256PublicKey::from_secret_key(&Bn256SecretKey::from_slice(&[3; 32]).unwrap())
                .unwrap();
        let bls_pk_2 = Bn256PublicKey {
            public_key: bls_pk.public_key[1..63].to_vec(),
            uncompressed: Default::default(),
        };
        assert!(!bls_pk_2.is_valid());
    }

    #[test]
    fn test_is_valid_false() {
        let bls_pk = Bn256PublicKey {
            public_key: vec![1; 65],
            uncompressed: Default::default(),
        };
        assert!(!bls_pk.is_valid());
    }

    #[test]
    fn test_magic_line() {
        let k = 10_f64;
        let m = -1.37;

        assert_eq!(magic_line(0_f64, m, k), 10);
        assert_eq!(magic_line(1_f64, m, k), 9);
        assert_eq!(magic_line(2_f64, m, k), 7);
        assert_eq!(magic_line(3_f64, m, k), 6);
        assert_eq!(magic_line(4_f64, m, k), 5);
        assert_eq!(magic_line(5_f64, m, k), 3);
        assert_eq!(magic_line(6_f64, m, k), 2);
        assert_eq!(magic_line(7_f64, m, k), 0);
        assert_eq!(magic_line(8_f64, m, k), 0);
    }

    // Auxiliar function to add reputation
    fn add_rep(rep_engine: &mut ReputationEngine, alpha: u32, pkh: PublicKeyHash, rep: u32) {
        rep_engine
            .trs_mut()
            .gain(Alpha(alpha), vec![(pkh, Reputation(rep))])
            .unwrap();
    }

    #[test]
    fn test_trapezoid_reputation_equal_reputation() {
        let mut rep_engine = ReputationEngine::new(1000);
        let mut ids = vec![];
        for i in 0..6 {
            ids.push(PublicKeyHash::from_bytes(&[i; 20]).unwrap());
        }
        rep_engine.ars_mut().push_activity(ids.clone());

        for id in ids.clone() {
            add_rep(&mut rep_engine, 10, id, 10);
        }

        let (trapezoid_hm, total) = trapezoidal_eligibility(&ids, rep_engine.trs());
        assert_eq!(total, 60);

        let trapezoid: Vec<u32> = trapezoid_hm.values().cloned().collect();
        assert_eq!(trapezoid, vec![10, 10, 10, 10, 10, 10]);
    }

    #[test]
    fn test_trapezoid_reputation_specific_example() {
        let mut rep_engine = ReputationEngine::new(1000);
        let mut ids = vec![];
        for i in 0..8 {
            ids.push(PublicKeyHash::from_bytes(&[i; 20]).unwrap());
        }
        rep_engine.ars_mut().push_activity(ids.clone());

        add_rep(&mut rep_engine, 10, ids[0], 79);
        add_rep(&mut rep_engine, 10, ids[1], 9);
        add_rep(&mut rep_engine, 10, ids[2], 1);
        add_rep(&mut rep_engine, 10, ids[3], 1);
        add_rep(&mut rep_engine, 10, ids[4], 1);
        add_rep(&mut rep_engine, 10, ids[5], 1);

        let (trapezoid_hm, total) = trapezoidal_eligibility(&ids, rep_engine.trs());
        assert_eq!(total, 92);

        assert_eq!(trapezoid_hm.get(&ids[0]), Some(&27));
        assert_eq!(trapezoid_hm.get(&ids[1]), Some(&22));
        assert_eq!(trapezoid_hm.get(&ids[2]), Some(&18));
        assert_eq!(trapezoid_hm.get(&ids[3]), Some(&13));
        assert_eq!(trapezoid_hm.get(&ids[4]), Some(&8));
        assert_eq!(trapezoid_hm.get(&ids[5]), Some(&4));
        assert_eq!(trapezoid_hm.get(&ids[6]), None);
        assert_eq!(trapezoid_hm.get(&ids[7]), None);

        rep_engine
            .trs_mut()
            .gain(Alpha(10), vec![(ids[6], Reputation(1))])
            .unwrap();

        let (trapezoid_hm, total) = trapezoidal_eligibility(&ids, rep_engine.trs());
        assert_eq!(total, 93);

        assert_eq!(trapezoid_hm.get(&ids[0]), Some(&23));
        assert_eq!(trapezoid_hm.get(&ids[1]), Some(&20));
        assert_eq!(trapezoid_hm.get(&ids[2]), Some(&16));
        assert_eq!(trapezoid_hm.get(&ids[3]), Some(&13));
        assert_eq!(trapezoid_hm.get(&ids[4]), Some(&10));
        assert_eq!(trapezoid_hm.get(&ids[5]), Some(&7));
        assert_eq!(trapezoid_hm.get(&ids[6]), Some(&4));
        assert_eq!(trapezoid_hm.get(&ids[7]), None);
    }

    #[test]
    fn test_get_rep_ordered_ars_list() {
        let pkh_a = PublicKeyHash::from_bytes(&[
            1, 3, 18, 2, 58, 34, 200, 22, 1, 34, 239, 122, 111, 24, 186, 35, 56, 154, 20, 227,
        ])
        .unwrap();
        let pkh_b = PublicKeyHash::from_bytes(&[
            2, 33, 59, 141, 206, 133, 65, 87, 149, 222, 13, 181, 41, 22, 109, 39, 76, 125, 250, 232,
        ])
        .unwrap();
        let mut rep_engine = ReputationEngine::new(1000);
        rep_engine.ars_mut().push_activity(vec![pkh_a, pkh_b]);

        // "a" start with 10 and "b" with 5
        add_rep(&mut rep_engine, 10, pkh_a, 10);
        add_rep(&mut rep_engine, 10, pkh_b, 5);
        rep_engine.set_current_alpha(Alpha(10));
        let expected_order = vec![pkh_a, pkh_b];
        assert_eq!(rep_engine.get_rep_ordered_ars_list(), expected_order);

        // "b" get 10 points more
        add_rep(&mut rep_engine, 11, pkh_b, 10);
        rep_engine.set_current_alpha(Alpha(11));
        let expected_order = vec![pkh_b, pkh_a];
        assert_eq!(rep_engine.get_rep_ordered_ars_list(), expected_order);

        // "a" get 5 points more and there is a tie with "b"
        add_rep(&mut rep_engine, 12, pkh_a, 5);
        rep_engine.set_current_alpha(Alpha(12));
        let expected_order = vec![pkh_a, pkh_b];
        assert_eq!(rep_engine.get_rep_ordered_ars_list(), expected_order);

        // the tie persist but alpha changes
        rep_engine.set_current_alpha(Alpha(13));
        let expected_order = vec![pkh_b, pkh_a];
        assert_eq!(rep_engine.get_rep_ordered_ars_list(), expected_order);
    }

    #[test]
    fn test_calculate_trapezoid_triangle() {
        let total_rep = 150;
        let minimum = 50;
        let id_len = 2;
        let (triangle, triangle_rep) = calculate_trapezoid_triangle(total_rep, id_len, minimum);
        assert!(triangle_rep <= total_rep);
        assert_eq!(triangle, vec![38, 0]);

        let total_rep = 12457;
        let minimum = 4096;
        let id_len = 3;
        let (triangle, triangle_rep) = calculate_trapezoid_triangle(total_rep, id_len, minimum);
        assert!(triangle_rep <= total_rep);
        assert_eq!(triangle, vec![84, 42, 0]);

        let total_rep = 92;
        let minimum = 1;
        let id_len = 6;
        let (triangle, triangle_rep) = calculate_trapezoid_triangle(total_rep, id_len, minimum);
        assert!(triangle_rep <= total_rep);
        assert_eq!(triangle, vec![22, 17, 13, 9, 4, 0]);
    }

    #[ignore]
    #[test]
    fn test_dr_merkle_root_superblock() {
        let protocol_version = ProtocolVersion::default();
        let dr_txs = build_test_dr_txs(3);
        let mut b1 = block_example();
        let mut b2 = block_example();

        let b1_dr_root = merkle_tree_root(&[
            dr_txs[0].clone().versioned_hash(protocol_version).into(),
            dr_txs[1].clone().versioned_hash(protocol_version).into(),
        ]);
        let b2_dr_root =
            merkle_tree_root(&[dr_txs[2].clone().versioned_hash(protocol_version).into()]);

        b1.block_header.merkle_roots.dr_hash_merkle_root = b1_dr_root.into();
        b1.txns.data_request_txns = vec![dr_txs[0].clone(), dr_txs[1].clone()];
        b2.block_header.merkle_roots.dr_hash_merkle_root = b2_dr_root.into();
        b2.txns.data_request_txns = vec![dr_txs[2].clone()];

        let sb = mining_build_superblock(
            &[b1.block_header.clone(), b2.block_header.clone()],
            &[Hash::default()],
            1,
            Hash::default(),
            1,
            protocol_version,
        );

        let expected_indices = vec![0, 2, 2];
        let expected_lemma_lengths = vec![3, 3, 2];

        dr_root_superblock_loop_test(
            sb,
            expected_indices,
            expected_lemma_lengths,
            vec![b1, b2],
            dr_txs,
        );
    }

    #[ignore]
    #[test]
    fn test_dr_merkle_root_superblock_2() {
        let dr_txs = build_test_dr_txs(8);
        let protocol_version = ProtocolVersion::default();

        let mut b1 = block_example();
        let mut b2 = block_example();
        let mut b3 = block_example();

        let b1_dr_root = merkle_tree_root(&[
            dr_txs[0].clone().versioned_hash(protocol_version).into(),
            dr_txs[1].clone().versioned_hash(protocol_version).into(),
            dr_txs[2].clone().versioned_hash(protocol_version).into(),
        ]);
        let b2_dr_root = merkle_tree_root(&[
            dr_txs[3].clone().versioned_hash(protocol_version).into(),
            dr_txs[4].clone().versioned_hash(protocol_version).into(),
            dr_txs[5].clone().versioned_hash(protocol_version).into(),
        ]);
        let b3_dr_root = merkle_tree_root(&[
            dr_txs[6].clone().versioned_hash(protocol_version).into(),
            dr_txs[7].clone().versioned_hash(protocol_version).into(),
        ]);

        b1.block_header.merkle_roots.dr_hash_merkle_root = b1_dr_root.into();
        b1.txns.data_request_txns = vec![dr_txs[0].clone(), dr_txs[1].clone(), dr_txs[2].clone()];
        b2.block_header.merkle_roots.dr_hash_merkle_root = b2_dr_root.into();
        b2.txns.data_request_txns = vec![dr_txs[3].clone(), dr_txs[4].clone(), dr_txs[5].clone()];
        b3.block_header.merkle_roots.dr_hash_merkle_root = b3_dr_root.into();
        b3.txns.data_request_txns = vec![dr_txs[6].clone(), dr_txs[7].clone()];

        let sb = mining_build_superblock(
            &[
                b1.block_header.clone(),
                b2.block_header.clone(),
                b3.block_header.clone(),
            ],
            &[Hash::default()],
            1,
            Hash::default(),
            1,
            protocol_version,
        );

        let expected_indices = vec![0, 2, 2, 8, 10, 6, 4, 6];
        let expected_lemma_lengths = vec![5, 5, 4, 5, 5, 4, 3, 3];

        dr_root_superblock_loop_test(
            sb,
            expected_indices,
            expected_lemma_lengths,
            vec![b1, b2, b3],
            dr_txs,
        );
    }

    #[test]
    fn test_dr_merkle_root_none() {
        let dr_txs = build_test_dr_txs(3);
        let protocol_version = ProtocolVersion::default();

        let mut b1 = block_example();
        let mut b2 = block_example();

        let b1_dr_root =
            merkle_tree_root(&[dr_txs[0].clone().versioned_hash(protocol_version).into()]);
        let b2_dr_root =
            merkle_tree_root(&[dr_txs[1].clone().versioned_hash(protocol_version).into()]);

        b1.block_header.merkle_roots.dr_hash_merkle_root = b1_dr_root.into();
        b1.txns.data_request_txns = vec![dr_txs[0].clone()];
        b2.block_header.merkle_roots.dr_hash_merkle_root = b2_dr_root.into();
        b2.txns.data_request_txns = vec![dr_txs[1].clone()];

        let sb = mining_build_superblock(
            &[b1.block_header.clone(), b2.block_header.clone()],
            &[Hash::default()],
            1,
            Hash::default(),
            1,
            protocol_version,
        );

        let result = sb.dr_proof_of_inclusion(&[b1, b2], &dr_txs[2]);
        assert!(result.is_none());
    }

    #[test]
    fn test_dr_merkle_root_no_block() {
        let dr_txs = build_test_dr_txs(3);

        let sb = mining_build_superblock(
            &[],
            &[Hash::default()],
            1,
            Hash::default(),
            1,
            ProtocolVersion::default(),
        );

        let result = sb.dr_proof_of_inclusion(&[], &dr_txs[2]);
        assert!(result.is_none());
    }

    #[ignore]
    #[test]
    fn test_dr_merkle_root_superblock_single_block() {
        let dr_txs = build_test_dr_txs(2);
        let protocol_version = ProtocolVersion::default();

        let mut b1 = block_example();

        let b1_dr_root = merkle_tree_root(&[
            dr_txs[0].clone().versioned_hash(protocol_version).into(),
            dr_txs[1].clone().versioned_hash(protocol_version).into(),
        ]);

        b1.block_header.merkle_roots.dr_hash_merkle_root = b1_dr_root.into();
        b1.txns.data_request_txns = vec![dr_txs[0].clone(), dr_txs[1].clone()];

        let sb = mining_build_superblock(
            &[b1.block_header.clone()],
            &[Hash::default()],
            1,
            Hash::default(),
            1,
            protocol_version,
        );

        let expected_indices = vec![0, 2];
        let expected_lemma_lengths = vec![2, 2];

        dr_root_superblock_loop_test(
            sb,
            expected_indices,
            expected_lemma_lengths,
            vec![b1],
            dr_txs,
        );
    }

    #[ignore]
    #[test]
    fn test_tally_merkle_root_superblock() {
        let tally_txs = build_test_tally_txs(3);
        let protocol_version = ProtocolVersion::default();

        let mut b1 = block_example();
        let mut b2 = block_example();

        let b1_tally_root = merkle_tree_root(&[
            tally_txs[0].clone().versioned_hash(protocol_version).into(),
            tally_txs[1].clone().versioned_hash(protocol_version).into(),
        ]);
        let b2_tally_root =
            merkle_tree_root(&[tally_txs[2].clone().versioned_hash(protocol_version).into()]);

        b1.block_header.merkle_roots.tally_hash_merkle_root = b1_tally_root.into();
        b1.txns.tally_txns = vec![tally_txs[0].clone(), tally_txs[1].clone()];
        b2.block_header.merkle_roots.tally_hash_merkle_root = b2_tally_root.into();
        b2.txns.tally_txns = vec![tally_txs[2].clone()];

        let sb = mining_build_superblock(
            &[b1.block_header.clone(), b2.block_header.clone()],
            &[Hash::default()],
            1,
            Hash::default(),
            1,
            protocol_version,
        );

        let expected_indices = vec![0, 2, 2];
        let expected_lemma_lengths = vec![3, 3, 2];

        tally_root_superblock_loop_test(
            sb,
            expected_indices,
            expected_lemma_lengths,
            vec![b1, b2],
            tally_txs,
            protocol_version,
        );
    }

    #[ignore]
    #[test]
    fn test_tally_merkle_root_superblock_2() {
        let tally_txs = build_test_tally_txs(8);
        let protocol_version = ProtocolVersion::default();

        let mut b1 = block_example();
        let mut b2 = block_example();
        let mut b3 = block_example();

        let b1_tally_root = merkle_tree_root(&[
            tally_txs[0].clone().versioned_hash(protocol_version).into(),
            tally_txs[1].clone().versioned_hash(protocol_version).into(),
            tally_txs[2].clone().versioned_hash(protocol_version).into(),
        ]);
        let b2_tally_root = merkle_tree_root(&[
            tally_txs[3].clone().versioned_hash(protocol_version).into(),
            tally_txs[4].clone().versioned_hash(protocol_version).into(),
            tally_txs[5].clone().versioned_hash(protocol_version).into(),
        ]);
        let b3_tally_root = merkle_tree_root(&[
            tally_txs[6].clone().versioned_hash(protocol_version).into(),
            tally_txs[7].clone().versioned_hash(protocol_version).into(),
        ]);

        b1.block_header.merkle_roots.tally_hash_merkle_root = b1_tally_root.into();
        b1.txns.tally_txns = vec![
            tally_txs[0].clone(),
            tally_txs[1].clone(),
            tally_txs[2].clone(),
        ];
        b2.block_header.merkle_roots.tally_hash_merkle_root = b2_tally_root.into();
        b2.txns.tally_txns = vec![
            tally_txs[3].clone(),
            tally_txs[4].clone(),
            tally_txs[5].clone(),
        ];
        b3.block_header.merkle_roots.tally_hash_merkle_root = b3_tally_root.into();
        b3.txns.tally_txns = vec![tally_txs[6].clone(), tally_txs[7].clone()];

        let sb = mining_build_superblock(
            &[
                b1.block_header.clone(),
                b2.block_header.clone(),
                b3.block_header.clone(),
            ],
            &[Hash::default()],
            1,
            Hash::default(),
            1,
            protocol_version,
        );

        let expected_indices = vec![0, 2, 2, 8, 10, 6, 4, 6];
        let expected_lemma_lengths = vec![5, 5, 4, 5, 5, 4, 3, 3];

        tally_root_superblock_loop_test(
            sb,
            expected_indices,
            expected_lemma_lengths,
            vec![b1, b2, b3],
            tally_txs,
            protocol_version,
        );
    }

    #[test]
    fn test_tally_merkle_root_none() {
        let tally_txs = build_test_tally_txs(3);
        let protocol_version = ProtocolVersion::default();

        let mut b1 = block_example();
        let mut b2 = block_example();

        let b1_tally_root =
            merkle_tree_root(&[tally_txs[0].clone().versioned_hash(protocol_version).into()]);
        let b2_tally_root =
            merkle_tree_root(&[tally_txs[1].clone().versioned_hash(protocol_version).into()]);

        b1.block_header.merkle_roots.tally_hash_merkle_root = b1_tally_root.into();
        b1.txns.tally_txns = vec![tally_txs[0].clone()];
        b2.block_header.merkle_roots.tally_hash_merkle_root = b2_tally_root.into();
        b2.txns.tally_txns = vec![tally_txs[1].clone()];

        let sb = mining_build_superblock(
            &[b1.block_header.clone(), b2.block_header.clone()],
            &[Hash::default()],
            1,
            Hash::default(),
            1,
            ProtocolVersion::default(),
        );

        let result = sb.tally_proof_of_inclusion(&[b1, b2], &tally_txs[2], protocol_version);
        assert!(result.is_none());
    }

    #[ignore]
    #[test]
    fn test_tally_merkle_root_superblock_single_block() {
        let tally_txs = build_test_tally_txs(3);
        let protocol_version = ProtocolVersion::default();

        let mut b1 = block_example();

        let b1_tally_root = merkle_tree_root(&[
            tally_txs[0].clone().versioned_hash(protocol_version).into(),
            tally_txs[1].clone().versioned_hash(protocol_version).into(),
            tally_txs[2].clone().versioned_hash(protocol_version).into(),
        ]);

        b1.block_header.merkle_roots.tally_hash_merkle_root = b1_tally_root.into();
        b1.txns.tally_txns = vec![
            tally_txs[0].clone(),
            tally_txs[1].clone(),
            tally_txs[2].clone(),
        ];

        let sb = mining_build_superblock(
            &[b1.block_header.clone()],
            &[Hash::default()],
            1,
            Hash::default(),
            1,
            protocol_version,
        );

        let expected_indices = vec![0, 2, 2];
        let expected_lemma_lengths = vec![3, 3, 2];

        tally_root_superblock_loop_test(
            sb,
            expected_indices,
            expected_lemma_lengths,
            vec![b1],
            tally_txs,
            protocol_version,
        );
    }

    #[test]
    fn pkh_alpha_hash_test() {
        let pkh = PublicKeyHash::default();
        let alpha = Alpha(0x12345678);
        let expected_hash: Hash =
            "2fa45432b83defdee33823c104fde4bc66379f69284bed90d82f12a8d20396cf"
                .parse()
                .unwrap();
        assert_eq!(pkh_alpha_hash(&pkh, alpha), expected_hash);
    }

    #[test]
    fn hash_div_mod_same_as_solidity() {
        // Check that the implementation of Hash::div_mod is compatible with Solidity.
        // Test solidity code:
        /*
               uint256 number = 0x0102030405060708090A0B0C0D0E0F101112131415161718191A1B1C1D1E1F20;
               bytes numberBytes = abi.encode(num);
               uint256 numberHash = uint256(sha256(numberBytes));
               uint256 numberHashDiv256 = numberHash / 256;
               uint256 numberHashMod256 = numberHash % 256;
        */
        // Test input in hex: 0x0102030405060708090A0B0C0D0E0F101112131415161718191A1B1C1D1E1F20
        // Test input in decimal: 455867356320691211509944977504407603390036387149619137164185182714736811808
        // Hash of test input in decimal: 78761488261205555724353619469726687646898473258189912794368218767476071469769
        // Hash of test input divided by 256 in decimal: 307662063520334202048256326053619873620697161164804346853000854560453404178
        // Remainder: 201
        let num_bytes: Hash = "0102030405060708090A0B0C0D0E0F101112131415161718191A1B1C1D1E1F20"
            .parse()
            .unwrap();
        let number_hash = Hash::from(calculate_sha256(num_bytes.as_ref()));
        let expected_number_hash =
            "ae216c2ef5247a3782c135efa279a3e4cdc61094270f5d2be58c6204b7a612c9"
                .parse()
                .unwrap();
        assert_eq!(number_hash, expected_number_hash);

        let expected_div = "00ae216c2ef5247a3782c135efa279a3e4cdc61094270f5d2be58c6204b7a612"
            .parse()
            .unwrap();
        let expected_mod = 201;

        assert_eq!(number_hash.div_mod(256), (expected_div, expected_mod));
    }

    #[test]
    fn hash_div_mod_256() {
        // Dividing the hash by 256 is the same as shifting the bytes 1 position to the right
        let h = Hash::SHA256([
            1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,
            25, 26, 27, 28, 29, 30, 31, 32,
        ]);
        let expected = (
            Hash::SHA256([
                0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22,
                23, 24, 25, 26, 27, 28, 29, 30, 31,
            ]),
            32,
        );
        assert_eq!(h.div_mod(256), expected);
    }

    #[test]
    fn hash_div_mod_65536() {
        // Dividing the hash by 65536 is the same as shifting the bytes 2 position to the right
        let h = Hash::SHA256([
            1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,
            25, 26, 27, 28, 29, 30, 31, 32,
        ]);
        let expected = (
            Hash::SHA256([
                0, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21,
                22, 23, 24, 25, 26, 27, 28, 29, 30,
            ]),
            31 * 256 + 32,
        );
        assert_eq!(h.div_mod(65536), expected);
    }

    #[test]
    fn hash_div_mod_3() {
        // 0xFF == 0x55 * 3
        let h = Hash::SHA256([0xFF; 32]);
        let expected = (Hash::SHA256([0x55; 32]), 0);
        assert_eq!(h.div_mod(3), expected);
    }

    #[test]
    #[should_panic = "division by zero"]
    fn hash_div_mod_0() {
        // The EVM defines division by 0 to return 0, but Solidity checks for division by 0 and
        // reverts the transaction.
        let h = Hash::SHA256([
            1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,
            25, 26, 27, 28, 29, 30, 31, 32,
        ]);
        let expected = (Hash::SHA256([0; 32]), 0);
        assert_eq!(h.div_mod(0), expected);
    }

    fn sign_tx<H: Hashable>(mk: [u8; 32], tx: &H) -> KeyedSignature {
        let Hash::SHA256(data) = tx.hash();

        let secret_key =
            Secp256k1_SecretKey::from_slice(&mk).expect("32 bytes, within curve order");
        let public_key = Secp256k1_PublicKey::from_secret_key_global(&secret_key);
        let public_key = PublicKey::from(public_key);

        let signature = sign(secret_key, &data).unwrap();

        KeyedSignature {
            signature: Signature::from(signature),
            public_key,
        }
    }

    #[test]
    fn remove_unconfirmed_transactions_clear_commits_and_reveals() {
        let mut tx_pool = TransactionsPool::default();
        let dr_pointer = Hash::with_first_u32(0x03ff_ffff);
        let sk: [u8; 32] = [0xcd; 32];

        // Create commit
        let mut c = CommitTransaction::default();
        c.body.dr_pointer = dr_pointer;
        let ks = sign_tx(sk, &c.body);
        let pkh = ks.public_key.pkh();
        c.signatures = vec![ks];

        // Insert commit
        tx_pool.insert(Transaction::Commit(c.clone()), 1);
        assert!(tx_pool
            .commit_contains(&dr_pointer, &pkh, &c.hash())
            .unwrap());

        // Create reveal
        let mut r = RevealTransaction::default();
        r.body.dr_pointer = dr_pointer;
        r.body.pkh = pkh;

        // Insert reveal
        tx_pool.insert(Transaction::Reveal(r.clone()), 1);
        assert!(tx_pool
            .reveal_contains(&dr_pointer, &pkh, &r.hash())
            .unwrap());

        let _x = tx_pool.remove_unconfirmed_transactions();

        // Ensure there are no commits and reveals after 'remove_unconfirmed_transactions' call
        assert!(!tx_pool
            .commit_contains(&dr_pointer, &pkh, &c.hash())
            .unwrap());
        assert!(!tx_pool
            .reveal_contains(&dr_pointer, &pkh, &r.hash())
            .unwrap());
    }

    #[test]
    fn data_request_lifecycle() {
        let extra_rounds = 3;
        // Initial state
        let mut state = DataRequestState::default();
        state.data_request.witnesses = 1;
        assert_eq!(state.stage, DataRequestStage::COMMIT);
        assert_eq!(state.info.current_commit_round, 0);
        // First commitment round
        state.update_stage(extra_rounds, false);
        assert_eq!(state.stage, DataRequestStage::COMMIT);
        assert_eq!(state.info.current_commit_round, 1);
        // Second commitment round
        state.update_stage(extra_rounds, false);
        assert_eq!(state.stage, DataRequestStage::COMMIT);
        assert_eq!(state.info.current_commit_round, 2);
        // Third commitment round
        state.update_stage(extra_rounds, false);
        assert_eq!(state.stage, DataRequestStage::COMMIT);
        assert_eq!(state.info.current_commit_round, 3);
        // Fourth and last commitment round
        state.update_stage(extra_rounds, false);
        assert_eq!(state.stage, DataRequestStage::COMMIT);
        assert_eq!(state.info.current_commit_round, 4);
        // We introduce at least 1 commit to force the stage to move to reveal
        let _ = state.add_commit(Default::default(), Default::default());
        // First reveal round
        state.update_stage(extra_rounds, false);
        assert_eq!(state.stage, DataRequestStage::REVEAL);
        assert_eq!(state.info.current_reveal_round, 1);
        // Second reveal round
        state.update_stage(extra_rounds, false);
        assert_eq!(state.stage, DataRequestStage::REVEAL);
        assert_eq!(state.info.current_reveal_round, 2);
        // Third reveal round
        state.update_stage(extra_rounds, false);
        assert_eq!(state.stage, DataRequestStage::REVEAL);
        assert_eq!(state.info.current_reveal_round, 3);
        // Fourth reveal round
        state.update_stage(extra_rounds, false);
        assert_eq!(state.stage, DataRequestStage::REVEAL);
        assert_eq!(state.info.current_reveal_round, 4);
        // Jumped to tally stage
        state.update_stage(extra_rounds, false);
        assert_eq!(state.stage, DataRequestStage::TALLY);
    }
}