lighthouse/eth2/utils/tree_hash/src/standard_tree_hash.rs

use super::*;
use hashing::hash;
use int_to_bytes::int_to_bytes32;
use ssz::ssz_encode;

pub trait TreeHash {
    fn tree_hash_item_type() -> ItemType;

    fn tree_hash_packed_encoding(&self) -> Vec<u8>;

    fn hash_tree_root(&self) -> Vec<u8>;
}

impl TreeHash for u64 {
    fn tree_hash_item_type() -> ItemType {
        ItemType::Basic
    }

    fn tree_hash_packed_encoding(&self) -> Vec<u8> {
        ssz_encode(self)
    }

    fn hash_tree_root(&self) -> Vec<u8> {
        int_to_bytes32(*self)
    }
}

impl<T> TreeHash for Vec<T>
where
    T: TreeHash,
{
    fn tree_hash_item_type() -> ItemType {
        ItemType::List
    }

    fn tree_hash_packed_encoding(&self) -> Vec<u8> {
        unreachable!("List should never be packed.")
    }

    fn hash_tree_root(&self) -> Vec<u8> {
        let leaves = match T::tree_hash_item_type() {
            ItemType::Basic => {
                let mut leaves = vec![];

                for item in self {
                    leaves.append(&mut item.tree_hash_packed_encoding());
                }

                leaves
            }
            ItemType::Composite | ItemType::List => {
                let mut leaves = Vec::with_capacity(self.len() * HASHSIZE);

                for item in self {
                    leaves.append(&mut item.hash_tree_root())
                }

                leaves
            }
        };

        // Mix in the length
        let mut root_and_len = Vec::with_capacity(HASHSIZE * 2);
        root_and_len.append(&mut efficient_merkleize(&leaves)[0..32].to_vec());
        root_and_len.append(&mut int_to_bytes32(self.len() as u64));

        hash(&root_and_len)
    }
}

pub fn efficient_merkleize(bytes: &[u8]) -> Vec<u8> {
    let leaves = num_sanitized_leaves(bytes.len());
    let nodes = num_nodes(leaves);
    let internal_nodes = nodes - leaves;

    let num_bytes = internal_nodes * HASHSIZE + bytes.len();

    let mut o: Vec<u8> = vec![0; internal_nodes * HASHSIZE];
    o.append(&mut bytes.to_vec());

    assert_eq!(o.len(), num_bytes);

    let empty_chunk_hash = hash(&[0; MERKLE_HASH_CHUNCK]);

    let mut i = nodes * HASHSIZE;
    let mut j = internal_nodes * HASHSIZE;

    while i >= MERKLE_HASH_CHUNCK {
        i -= MERKLE_HASH_CHUNCK;

        j -= HASHSIZE;
        let hash = match o.get(i..i + MERKLE_HASH_CHUNCK) {
            // All bytes are available, hash as ususal.
            Some(slice) => hash(slice),
            // Unable to get all the bytes.
            None => {
                match o.get(i..) {
                    // Able to get some of the bytes, pad them out.
                    Some(slice) => {
                        let mut bytes = slice.to_vec();
                        bytes.resize(MERKLE_HASH_CHUNCK, 0);
                        hash(&bytes)
                    }
                    // Unable to get any bytes, use the empty-chunk hash.
                    None => empty_chunk_hash.clone(),
                }
            }
        };

        o[j..j + HASHSIZE].copy_from_slice(&hash);
    }

    o
}