pallas-validate 1.0.0

//! Base types used for validating transactions in each era.

pub mod environment;
pub mod validation;

pub use environment::*;
use pallas_addresses::{Address, ShelleyAddress, ShelleyPaymentPart};
use pallas_codec::{
    minicbor::encode,
    utils::{Bytes, Nullable},
};
use pallas_crypto::key::ed25519::{PublicKey, Signature};
use pallas_primitives::{
    AddrKeyhash, AssetName, Coin, Epoch, GenesisDelegateHash, Genesishash, Hash, NetworkId,
    NonZeroInt, PlutusScript, PolicyId, PoolKeyhash, PoolMetadata, PositiveCoin, Relay,
    RewardAccount, StakeCredential, TransactionIndex, UnitInterval, VrfKeyhash,
    alonzo::{Multiasset, NativeScript, Tx as AlonzoTx, VKeyWitness, Value},
    babbage::Tx as BabbageTx,
    conway::{Multiasset as ConwayMultiasset, Tx as ConwayTx, Value as ConwayValue},
};

use pallas_traverse::{Era, MultiEraInput, MultiEraOutput, MultiEraUpdate, time::Slot};
use serde::{Deserialize, Serialize};
use std::collections::{HashMap, HashSet};
use std::ops::Deref;
pub use validation::*;

pub type TxHash = Hash<32>;
pub type TxoIdx = u32;

#[derive(Debug, Eq, PartialEq, Clone)]
pub struct EraCbor(pub Era, pub Vec<u8>);

impl From<(Era, Vec<u8>)> for EraCbor {
    fn from(value: (Era, Vec<u8>)) -> Self {
        Self(value.0, value.1)
    }
}

impl From<EraCbor> for (Era, Vec<u8>) {
    fn from(value: EraCbor) -> Self {
        (value.0, value.1)
    }
}

impl From<MultiEraOutput<'_>> for EraCbor {
    fn from(value: MultiEraOutput<'_>) -> Self {
        EraCbor(value.era(), value.encode())
    }
}

impl<'a> TryFrom<&'a EraCbor> for MultiEraOutput<'a> {
    type Error = pallas_codec::minicbor::decode::Error;

    fn try_from(value: &'a EraCbor) -> Result<Self, Self::Error> {
        MultiEraOutput::decode(value.0, &value.1)
    }
}

impl TryFrom<EraCbor> for MultiEraUpdate<'_> {
    type Error = pallas_codec::minicbor::decode::Error;

    fn try_from(value: EraCbor) -> Result<Self, Self::Error> {
        MultiEraUpdate::decode_for_era(value.0, &value.1)
    }
}

pub type UtxoBody<'a> = MultiEraOutput<'a>;

#[derive(Debug, Eq, PartialEq, Hash, Clone, Serialize, Deserialize)]
pub struct TxoRef(pub TxHash, pub TxoIdx);

impl From<(TxHash, TxoIdx)> for TxoRef {
    fn from(value: (TxHash, TxoIdx)) -> Self {
        Self(value.0, value.1)
    }
}

impl From<TxoRef> for (TxHash, TxoIdx) {
    fn from(value: TxoRef) -> Self {
        (value.0, value.1)
    }
}

impl From<&MultiEraInput<'_>> for TxoRef {
    fn from(value: &MultiEraInput<'_>) -> Self {
        TxoRef(*value.hash(), value.index() as u32)
    }
}

pub type UtxoMap = HashMap<TxoRef, EraCbor>;

pub type UtxoSet = HashSet<TxoRef>;

pub type UTxOs<'b> = HashMap<MultiEraInput<'b>, MultiEraOutput<'b>>;

pub fn get_alonzo_comp_tx_size(mtx: &AlonzoTx) -> u32 {
    match &mtx.auxiliary_data {
        Nullable::Some(aux_data) => {
            (aux_data.raw_cbor().len()
                + mtx.transaction_body.raw_cbor().len()
                + mtx.transaction_witness_set.raw_cbor().len()) as u32
        }
        _ => {
            (mtx.transaction_body.raw_cbor().len() + mtx.transaction_witness_set.raw_cbor().len())
                as u32
        }
    }
}

pub fn get_babbage_tx_size(mtx: &BabbageTx) -> Option<u32> {
    let mut buff: Vec<u8> = Vec::new();
    match encode(mtx, &mut buff) {
        Ok(()) => Some(buff.len() as u32),
        Err(_) => None,
    }
}

pub fn get_conway_tx_size(mtx: &ConwayTx) -> Option<u32> {
    let mut buff: Vec<u8> = Vec::new();
    match encode(mtx, &mut buff) {
        Ok(()) => Some(buff.len() as u32),
        Err(_) => None,
    }
}

pub fn empty_value() -> Value {
    Value::Multiasset(0, std::collections::BTreeMap::new())
}

pub fn add_values(
    first: &Value,
    second: &Value,
    err: &ValidationError,
) -> Result<Value, ValidationError> {
    match (first, second) {
        (Value::Coin(f), Value::Coin(s)) => Ok(Value::Coin(f + s)),
        (Value::Multiasset(f, fma), Value::Coin(s)) => Ok(Value::Multiasset(f + s, fma.clone())),
        (Value::Coin(f), Value::Multiasset(s, sma)) => Ok(Value::Multiasset(f + s, sma.clone())),
        (Value::Multiasset(f, fma), Value::Multiasset(s, sma)) => Ok(Value::Multiasset(
            f + s,
            coerce_to_coin(
                &add_multiasset_values(&coerce_to_i64(fma), &coerce_to_i64(sma)),
                err,
            )?,
        )),
    }
}

pub fn conway_add_values(
    first: &ConwayValue,
    second: &ConwayValue,
    err: &ValidationError,
) -> Result<ConwayValue, ValidationError> {
    match (first, second) {
        (ConwayValue::Coin(f), ConwayValue::Coin(s)) => Ok(ConwayValue::Coin(f + s)),
        (ConwayValue::Multiasset(f, fma), ConwayValue::Coin(s)) => {
            Ok(ConwayValue::Multiasset(f + s, fma.clone()))
        }
        (ConwayValue::Coin(f), ConwayValue::Multiasset(s, sma)) => {
            Ok(ConwayValue::Multiasset(f + s, sma.clone()))
        }
        (ConwayValue::Multiasset(f, fma), ConwayValue::Multiasset(s, sma)) => {
            Ok(ConwayValue::Multiasset(
                f + s,
                conway_coerce_to_coin(
                    &conway_add_multiasset_values(&coerce_to_u64(fma), &coerce_to_u64(sma)),
                    err,
                )?,
            ))
        }
    }
}

pub fn lovelace_diff_or_fail(
    first: &Value,
    second: &Value,
    err: &ValidationError,
) -> Result<u64, ValidationError> {
    match (first, second) {
        (Value::Coin(f), Value::Coin(s)) => {
            if f >= s {
                Ok(f - s)
            } else {
                Err(err.clone())
            }
        }
        (Value::Coin(_), Value::Multiasset(_, _)) => Err(err.clone()),
        (Value::Multiasset(f, fma), Value::Coin(s)) => {
            if f >= s && fma.is_empty() {
                Ok(f - s)
            } else {
                Err(err.clone())
            }
        }
        (Value::Multiasset(f, fma), Value::Multiasset(s, sma)) => {
            if f >= s && multi_assets_are_equal(fma, sma) {
                Ok(f - s)
            } else {
                Err(err.clone())
            }
        }
    }
}

pub fn conway_lovelace_diff_or_fail(
    first: &ConwayValue,
    second: &ConwayValue,
    err: &ValidationError,
) -> Result<u64, ValidationError> {
    match (first, second) {
        (ConwayValue::Coin(f), ConwayValue::Coin(s)) => {
            if f >= s {
                Ok(f - s)
            } else {
                Err(err.clone())
            }
        }
        (ConwayValue::Coin(_), ConwayValue::Multiasset(_, _)) => Err(err.clone()),
        (ConwayValue::Multiasset(f, fma), ConwayValue::Coin(s)) => {
            if f >= s && fma.is_empty() {
                Ok(f - s)
            } else {
                Err(err.clone())
            }
        }
        (ConwayValue::Multiasset(f, fma), ConwayValue::Multiasset(s, sma)) => {
            if f >= s && conway_multi_assets_are_equal(fma, sma) {
                Ok(f - s)
            } else {
                Err(err.clone())
            }
        }
    }
}

pub fn multi_assets_are_equal(fma: &Multiasset<Coin>, sma: &Multiasset<Coin>) -> bool {
    multi_asset_included(fma, sma) && multi_asset_included(sma, fma)
}
pub fn conway_multi_assets_are_equal(
    fma: &ConwayMultiasset<PositiveCoin>,
    sma: &ConwayMultiasset<PositiveCoin>,
) -> bool {
    conway_multi_asset_included(fma, sma) && conway_multi_asset_included(sma, fma)
}

pub fn multi_asset_included(fma: &Multiasset<Coin>, sma: &Multiasset<Coin>) -> bool {
    for (fpolicy, fassets) in fma.iter() {
        match find_policy(sma, fpolicy) {
            Some(sassets) => {
                for (fasset_name, famount) in fassets.iter() {
                    // Discard the case where there is 0 of an asset
                    if *famount != 0 {
                        match find_assets(&sassets, fasset_name) {
                            Some(samount) => {
                                if *famount != samount {
                                    return false;
                                }
                            }
                            None => return false,
                        };
                    }
                }
            }
            None => return false,
        }
    }
    true
}

pub fn conway_multi_asset_included(
    fma: &ConwayMultiasset<PositiveCoin>,
    sma: &ConwayMultiasset<PositiveCoin>,
) -> bool {
    for (fpolicy, fassets) in fma.iter() {
        match conway_find_policy(sma, fpolicy) {
            Some(sassets) => {
                for (fasset_name, famount) in fassets.iter() {
                    // Discard the case where there is 0 of an asset
                    if *famount >= PositiveCoin::try_from(1).unwrap() {
                        match conway_find_assets(&sassets, fasset_name) {
                            Some(samount) => {
                                if *famount != samount {
                                    return false;
                                }
                            }
                            None => return false,
                        };
                    }
                }
            }
            None => return false,
        }
    }
    true
}

pub fn add_minted_value(
    base_value: &Value,
    minted_value: &Multiasset<i64>,
    err: &ValidationError,
) -> Result<Value, ValidationError> {
    match base_value {
        Value::Coin(n) => Ok(Value::Multiasset(*n, coerce_to_coin(minted_value, err)?)),
        Value::Multiasset(n, mary_base_value) => Ok(Value::Multiasset(
            *n,
            coerce_to_coin(
                &add_multiasset_values(&coerce_to_i64(mary_base_value), minted_value),
                err,
            )?,
        )),
    }
}
pub fn conway_add_minted_value(
    base_value: &ConwayValue,
    minted_value: &ConwayMultiasset<u64>,
    err: &ValidationError,
) -> Result<ConwayValue, ValidationError> {
    match base_value {
        ConwayValue::Coin(n) => Ok(ConwayValue::Multiasset(
            *n,
            conway_coerce_to_coin(minted_value, err)?,
        )),
        ConwayValue::Multiasset(n, mary_base_value) => Ok(ConwayValue::Multiasset(
            *n,
            conway_coerce_to_coin(
                &conway_add_multiasset_values(&coerce_to_u64(mary_base_value), minted_value),
                err,
            )?,
        )),
    }
}

pub fn conway_add_minted_non_zero(
    base_value: &ConwayValue,
    minted_value: &ConwayMultiasset<NonZeroInt>,
    err: &ValidationError,
) -> Result<ConwayValue, ValidationError> {
    match base_value {
        ConwayValue::Coin(n) => Ok(ConwayValue::Multiasset(
            *n,
            conway_coerce_to_non_zero_coin(minted_value, err)?,
        )),
        ConwayValue::Multiasset(n, mary_base_value) => Ok(ConwayValue::Multiasset(
            *n,
            conway_coerce_to_coin(
                &conway_add_multiasset_non_negative_values(
                    &coerce_to_u64(mary_base_value),
                    minted_value,
                )?,
                err,
            )?,
        )),
    }
}

fn coerce_to_i64(value: &Multiasset<Coin>) -> Multiasset<i64> {
    let mut res: Vec<(PolicyId, _)> = Vec::new();
    for (policy, assets) in value.iter() {
        let mut aa: Vec<(AssetName, i64)> = Vec::new();
        for (asset_name, amount) in assets.iter() {
            aa.push((asset_name.clone(), *amount as i64));
        }
        res.push((*policy, aa.into_iter().collect()));
    }
    res.into_iter().collect()
}

fn coerce_to_u64(value: &ConwayMultiasset<PositiveCoin>) -> ConwayMultiasset<u64> {
    let mut res: Vec<(PolicyId, _)> = Vec::new();
    for (policy, assets) in value.iter() {
        let mut aa: Vec<(AssetName, u64)> = Vec::new();
        for (asset_name, amount) in assets.iter() {
            aa.push((asset_name.clone(), (*amount).into()));
        }
        res.push((*policy, aa.into_iter().collect()));
    }
    res.into_iter().collect()
}

fn coerce_to_coin(
    value: &Multiasset<i64>,
    _err: &ValidationError,
) -> Result<Multiasset<Coin>, ValidationError> {
    let mut res: Vec<(PolicyId, _)> = Vec::new();
    for (policy, assets) in value.iter() {
        let mut aa: Vec<(AssetName, Coin)> = Vec::new();
        for (asset_name, amount) in assets.iter() {
            aa.push((asset_name.clone(), *amount as u64));
        }
        res.push((*policy, aa.into_iter().collect()));
    }
    Ok(res.into_iter().collect())
}

fn conway_coerce_to_coin(
    value: &ConwayMultiasset<u64>,
    _err: &ValidationError,
) -> Result<ConwayMultiasset<PositiveCoin>, ValidationError> {
    let mut res: Vec<(PolicyId, _)> = Vec::new();
    for (policy, assets) in value.iter() {
        let mut aa: Vec<(AssetName, PositiveCoin)> = Vec::new();
        for (asset_name, amount) in assets.iter() {
            aa.push((asset_name.clone(), PositiveCoin::try_from(*amount).unwrap()));
        }
        res.push((*policy, aa.into_iter().collect()));
    }
    Ok(res.into_iter().collect())
}

fn conway_coerce_to_non_zero_coin(
    value: &ConwayMultiasset<NonZeroInt>,
    _err: &ValidationError,
) -> Result<ConwayMultiasset<PositiveCoin>, ValidationError> {
    let mut res: Vec<(PolicyId, _)> = Vec::new();
    for (policy, assets) in value.iter() {
        let mut aa: Vec<(AssetName, PositiveCoin)> = Vec::new();
        for (asset_name, amount) in assets.iter() {
            aa.push((
                asset_name.clone(),
                PositiveCoin::try_from(i64::from(amount) as u64).unwrap(),
            ));
        }
        res.push((*policy, aa.into_iter().collect()));
    }
    Ok(res.into_iter().collect())
}

fn add_multiasset_values(first: &Multiasset<i64>, second: &Multiasset<i64>) -> Multiasset<i64> {
    let mut res: HashMap<PolicyId, HashMap<AssetName, i64>> = HashMap::new();
    for (policy, new_assets) in first.iter() {
        match res.get(policy) {
            Some(old_assets) => res.insert(*policy, add_same_policy_assets(old_assets, new_assets)),
            None => res.insert(*policy, add_same_policy_assets(&HashMap::new(), new_assets)),
        };
    }
    for (policy, new_assets) in second.iter() {
        match res.get(policy) {
            Some(old_assets) => res.insert(*policy, add_same_policy_assets(old_assets, new_assets)),
            None => res.insert(*policy, add_same_policy_assets(&HashMap::new(), new_assets)),
        };
    }
    wrap_multiasset(res)
}

fn conway_add_multiasset_values<T>(
    first: &ConwayMultiasset<T>,
    second: &ConwayMultiasset<T>,
) -> ConwayMultiasset<T>
where
    T: std::ops::Add<Output = T> + Copy,
{
    let mut res: HashMap<PolicyId, HashMap<AssetName, T>> = HashMap::new();

    for (policy, new_assets) in first.iter() {
        match res.get(policy) {
            Some(old_assets) => res.insert(
                *policy,
                conway_add_same_policy_assets(old_assets, new_assets),
            ),
            None => res.insert(
                *policy,
                conway_add_same_policy_assets(&HashMap::new(), new_assets),
            ),
        };
    }
    for (policy, new_assets) in second.iter() {
        match res.get(policy) {
            Some(old_assets) => res.insert(
                *policy,
                conway_add_same_policy_assets(old_assets, new_assets),
            ),
            None => res.insert(
                *policy,
                conway_add_same_policy_assets(&HashMap::new(), new_assets),
            ),
        };
    }
    conway_wrap_multiasset(res)
}

fn conway_add_multiasset_non_negative_values(
    first: &ConwayMultiasset<u64>,
    second: &ConwayMultiasset<NonZeroInt>,
) -> Result<ConwayMultiasset<u64>, ValidationError> {
    let mut res: HashMap<PolicyId, HashMap<AssetName, u64>> = HashMap::new();

    for (policy, new_assets) in first.iter() {
        match res.get(policy) {
            Some(old_assets) => res.insert(
                *policy,
                conway_add_same_policy_assets(old_assets, new_assets),
            ),
            None => res.insert(
                *policy,
                conway_add_same_policy_assets(&HashMap::new(), new_assets),
            ),
        };
    }

    for (policy, new_assets) in second.iter() {
        match res.get(policy) {
            Some(old_assets) => res.insert(
                *policy,
                conway_add_same_non_zero_policy_assets(old_assets, new_assets)?,
            ),
            None => res.insert(
                *policy,
                conway_add_same_non_zero_policy_assets(&HashMap::new(), new_assets)?,
            ),
        };
    }

    // Remove any asset that has 0 quantity after the addition
    res.retain(|_, assets| {
        assets.retain(|_, amount| *amount > 0);
        !assets.is_empty()
    });

    Ok(conway_wrap_multiasset(res))
}

fn add_same_policy_assets(
    old_assets: &HashMap<AssetName, i64>,
    new_assets: &std::collections::BTreeMap<AssetName, i64>,
) -> HashMap<AssetName, i64> {
    let mut res: HashMap<AssetName, i64> = old_assets.clone();
    for (asset_name, new_amount) in new_assets.iter() {
        match res.get(asset_name) {
            Some(old_amount) => res.insert(asset_name.clone(), old_amount + *new_amount),
            None => res.insert(asset_name.clone(), *new_amount),
        };
    }
    res
}

fn conway_add_same_policy_assets<T>(
    old_assets: &HashMap<AssetName, T>,
    new_assets: &std::collections::BTreeMap<AssetName, T>,
) -> HashMap<AssetName, T>
where
    T: std::ops::Add<Output = T> + Copy,
{
    let mut res: HashMap<AssetName, T> = old_assets.clone();

    for (asset_name, new_amount) in new_assets.iter() {
        match res.get(asset_name) {
            Some(old_amount) => res.insert(asset_name.clone(), *old_amount + *new_amount),
            None => res.insert(asset_name.clone(), *new_amount),
        };
    }

    res
}

fn conway_add_same_non_zero_policy_assets(
    old_assets: &HashMap<AssetName, u64>,
    new_assets: &std::collections::BTreeMap<AssetName, NonZeroInt>,
) -> Result<HashMap<AssetName, u64>, ValidationError> {
    let mut res: HashMap<AssetName, u64> = old_assets.clone();

    for (asset_name, new_amount) in new_assets.iter() {
        match res.get(asset_name) {
            Some(old_amount) => {
                let result = (*old_amount as i64) + i64::from(new_amount);

                if result < 0 {
                    return Err(ValidationError::PostAlonzo(PostAlonzoError::NegativeValue));
                }

                res.insert(asset_name.clone(), result as u64)
            }
            None => res.insert(asset_name.clone(), i64::from(new_amount) as u64),
        };
    }

    Ok(res)
}

fn wrap_multiasset(input: HashMap<PolicyId, HashMap<AssetName, i64>>) -> Multiasset<i64> {
    input
        .into_iter()
        .map(|(policy, assets)| (policy, assets.into_iter().collect()))
        .collect()
}

fn conway_wrap_multiasset<T>(
    input: HashMap<PolicyId, HashMap<AssetName, T>>,
) -> ConwayMultiasset<T> {
    input
        .into_iter()
        .map(|(policy, assets)| (policy, assets.into_iter().collect()))
        .collect()
}

pub fn values_are_equal(first: &Value, second: &Value) -> bool {
    match (first, second) {
        (Value::Coin(f), Value::Coin(s)) => f == s,
        (Value::Multiasset(f, fma), Value::Coin(s)) => f == s && fma.is_empty(),
        (Value::Coin(f), Value::Multiasset(s, sma)) => f == s && sma.is_empty(),
        (Value::Multiasset(f, fma), Value::Multiasset(s, sma)) => {
            if f != s {
                false
            } else {
                multi_assets_are_equal(fma, sma)
            }
        }
    }
}
pub fn conway_values_are_equal(first: &ConwayValue, second: &ConwayValue) -> bool {
    match (first, second) {
        (ConwayValue::Coin(f), ConwayValue::Coin(s)) => f == s,
        (ConwayValue::Multiasset(f, fma), ConwayValue::Coin(s)) => f == s && fma.is_empty(),
        (ConwayValue::Coin(f), ConwayValue::Multiasset(s, sma)) => f == s && sma.is_empty(),
        (ConwayValue::Multiasset(f, fma), ConwayValue::Multiasset(s, sma)) => {
            if f != s {
                false
            } else {
                conway_multi_assets_are_equal(fma, sma)
            }
        }
    }
}

fn find_policy(
    mary_value: &Multiasset<Coin>,
    search_policy: &PolicyId,
) -> Option<std::collections::BTreeMap<AssetName, Coin>> {
    for (policy, assets) in mary_value.iter() {
        if policy == search_policy {
            return Some(assets.clone());
        }
    }
    None
}

fn conway_find_policy(
    mary_value: &ConwayMultiasset<PositiveCoin>,
    search_policy: &PolicyId,
) -> Option<std::collections::BTreeMap<AssetName, PositiveCoin>> {
    for (policy, assets) in mary_value.iter() {
        if policy == search_policy {
            return Some(assets.clone());
        }
    }
    None
}

fn find_assets(
    assets: &std::collections::BTreeMap<AssetName, Coin>,
    asset_name: &AssetName,
) -> Option<Coin> {
    for (an, amount) in assets.iter() {
        if an == asset_name {
            return Some(*amount);
        }
    }
    None
}
fn conway_find_assets(
    assets: &std::collections::BTreeMap<AssetName, PositiveCoin>,
    asset_name: &AssetName,
) -> Option<PositiveCoin> {
    for (an, amount) in assets.iter() {
        if an == asset_name {
            return Some(*amount);
        }
    }
    None
}

pub fn get_lovelace_from_alonzo_val(val: &Value) -> Coin {
    match val {
        Value::Coin(res) => *res,
        Value::Multiasset(res, _) => *res,
    }
}

pub fn get_lovelace_from_conway_val(val: &ConwayValue) -> Coin {
    match val {
        ConwayValue::Coin(res) => *res,
        ConwayValue::Multiasset(res, _) => *res,
    }
}

#[deprecated(since = "0.31.0", note = "use `u8::from(...)` instead")]
pub fn get_network_id_value(network_id: NetworkId) -> u8 {
    u8::from(network_id)
}

pub fn mk_alonzo_vk_wits_check_list(
    wits: &Option<Vec<VKeyWitness>>,
    err: ValidationError,
) -> Result<Vec<(bool, VKeyWitness)>, ValidationError> {
    Ok(wits
        .clone()
        .ok_or(err)?
        .iter()
        .map(|x| (false, x.clone()))
        .collect::<Vec<(bool, VKeyWitness)>>())
}

pub fn verify_signature(vk_wit: &VKeyWitness, data_to_verify: &[u8]) -> bool {
    let mut public_key_source: [u8; PublicKey::SIZE] = [0; PublicKey::SIZE];
    public_key_source.copy_from_slice(vk_wit.vkey.as_slice());
    let public_key: PublicKey = From::<[u8; PublicKey::SIZE]>::from(public_key_source);
    let mut signature_source: [u8; Signature::SIZE] = [0; Signature::SIZE];
    signature_source.copy_from_slice(vk_wit.signature.as_slice());
    let sig: Signature = From::<[u8; Signature::SIZE]>::from(signature_source);
    public_key.verify(data_to_verify, &sig)
}

pub fn get_payment_part(address: &Bytes) -> Option<ShelleyPaymentPart> {
    let addr: ShelleyAddress = get_shelley_address(Bytes::deref(address))?;
    Some(addr.payment().clone())
}

pub fn get_shelley_address(address: &[u8]) -> Option<ShelleyAddress> {
    match Address::from_bytes(address) {
        Ok(Address::Shelley(sa)) => Some(sa),
        _ => None,
    }
}

pub fn is_byron_address(address: &[u8]) -> bool {
    matches!(Address::from_bytes(address), Ok(Address::Byron(_)))
}

pub fn aux_data_from_alonzo_tx<'a>(mtx: &'a AlonzoTx) -> Option<&'a [u8]> {
    mtx.auxiliary_data.as_ref().map(|x| x.raw_cbor()).into()
}

pub fn aux_data_from_babbage_tx<'a>(mtx: &'a BabbageTx) -> Option<&'a [u8]> {
    mtx.auxiliary_data.as_ref().map(|x| x.raw_cbor()).into()
}

pub fn aux_data_from_conway_tx<'a>(mtx: &'a ConwayTx) -> Option<&'a [u8]> {
    mtx.auxiliary_data.as_ref().map(|x| x.raw_cbor()).into()
}

pub fn get_val_size_in_words(val: &Value) -> u64 {
    let mut tx_buf: Vec<u8> = Vec::new();
    let _ = encode(val, &mut tx_buf);
    (tx_buf.len() as u64).div_ceil(8) // ceiling of the result of dividing
}

pub fn conway_get_val_size_in_words(val: &ConwayValue) -> u64 {
    let mut tx_buf: Vec<u8> = Vec::new();
    let _ = encode(val, &mut tx_buf);
    (tx_buf.len() as u64).div_ceil(8) // ceiling of the result of dividing
}

pub fn compute_native_script_hash(script: &NativeScript) -> PolicyId {
    let mut payload = Vec::new();
    let _ = encode(script, &mut payload);
    payload.insert(0, 0);
    pallas_crypto::hash::Hasher::<224>::hash(&payload)
}

#[deprecated(since = "0.31.0", note = "use `compute_plutus_v1_script_hash` instead")]
pub fn compute_plutus_script_hash(script: &PlutusScript<1>) -> PolicyId {
    compute_plutus_v1_script_hash(script)
}

pub fn compute_plutus_v1_script_hash(script: &PlutusScript<1>) -> PolicyId {
    let mut payload: Vec<u8> = Vec::from(script.as_ref());
    payload.insert(0, 1);
    pallas_crypto::hash::Hasher::<224>::hash(&payload)
}

pub fn compute_plutus_v2_script_hash(script: &PlutusScript<2>) -> PolicyId {
    let mut payload: Vec<u8> = Vec::from(script.as_ref());
    payload.insert(0, 2);
    pallas_crypto::hash::Hasher::<224>::hash(&payload)
}

pub fn compute_plutus_v3_script_hash(script: &PlutusScript<3>) -> PolicyId {
    let mut payload: Vec<u8> = Vec::from(script.as_ref());
    payload.insert(0, 3);
    pallas_crypto::hash::Hasher::<224>::hash(&payload)
}

pub type CertificateIndex = u32;

#[derive(PartialEq, Eq, Hash, Clone)]
pub struct CertPointer {
    pub slot: Slot,
    pub tx_ix: TransactionIndex,
    pub cert_ix: CertificateIndex,
}

pub type GenesisDelegation = HashMap<Genesishash, (GenesisDelegateHash, VrfKeyhash)>;
pub type FutGenesisDelegation = HashMap<(Slot, Genesishash), (GenesisDelegateHash, VrfKeyhash)>;
pub type InstantaneousRewards = (
    HashMap<StakeCredential, Coin>,
    HashMap<StakeCredential, Coin>,
);

#[derive(Default, Clone)] // for testing
pub struct DState {
    pub rewards: HashMap<StakeCredential, Coin>,
    pub delegations: HashMap<StakeCredential, PoolKeyhash>,
    pub ptrs: HashMap<CertPointer, StakeCredential>,
    pub fut_gen_delegs: FutGenesisDelegation,
    pub gen_delegs: GenesisDelegation,
    pub inst_rewards: InstantaneousRewards,
}

// Essentially part of the `PoolRegistration` component of `Certificate` at
// alonzo/src/model.rs
#[derive(Clone, Debug)]
pub struct PoolParam {
    pub vrf_keyhash: VrfKeyhash,
    pub pledge: Coin,
    pub cost: Coin,
    pub margin: UnitInterval,
    pub reward_account: RewardAccount, // FIXME: Should be a `StakeCredential`, or `Hash<_>`???
    pub pool_owners: Vec<AddrKeyhash>,
    pub relays: Vec<Relay>,
    pub pool_metadata: Option<PoolMetadata>,
}

#[derive(Default, Clone)] // for testing
pub struct PState {
    pub pool_params: HashMap<PoolKeyhash, PoolParam>,
    pub fut_pool_params: HashMap<PoolKeyhash, PoolParam>,
    pub retiring: HashMap<PoolKeyhash, Epoch>,
}

// Originally `DPState` in ShelleyMA specs, then updated to
// `CertState` in Haskell sources at Intersect (#3369).
#[non_exhaustive]
#[derive(Default, Clone)] // for testing
pub struct CertState {
    pub pstate: PState,
    pub dstate: DState,
}