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 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257
use alloc::vec::Vec;
use super::{Digest, Felt, Hasher, ZERO};
use crate::utils::serde::{
ByteReader, ByteWriter, Deserializable, DeserializationError, Serializable,
};
/// The header of a block. It contains metadata about the block, commitments to the current
/// state of the chain and the hash of the proof that attests to the integrity of the chain.
///
/// A block header includes the following fields:
///
/// - `version` specifies the version of the protocol.
/// - `prev_hash` is the hash of the previous block header.
/// - `block_num` is a unique sequential number of the current block.
/// - `chain_root` is a commitment to an MMR of the entire chain where each block is a leaf.
/// - `account_root` is a commitment to account database.
/// - `nullifier_root` is a commitment to the nullifier database.
/// - `note_root` is a commitment to all notes created in the current block.
/// - `tx_hash` is a commitment to a set of IDs of transactions which affected accounts in the
/// block.
/// - `proof_hash` is a hash of a STARK proof attesting to the correct state transition.
/// - `timestamp` is the time when the block was created, in seconds since UNIX epoch. Current
/// representation is sufficient to represent time up to year 2106.
/// - `sub_hash` is a sequential hash of all fields except the note_root.
/// - `hash` is a 2-to-1 hash of the sub_hash and the note_root.
#[derive(Debug, Eq, PartialEq, Copy, Clone)]
#[cfg_attr(feature = "serde", derive(serde::Deserialize, serde::Serialize))]
pub struct BlockHeader {
version: u32,
prev_hash: Digest,
block_num: u32,
chain_root: Digest,
account_root: Digest,
nullifier_root: Digest,
note_root: Digest,
tx_hash: Digest,
proof_hash: Digest,
timestamp: u32,
sub_hash: Digest,
hash: Digest,
}
impl BlockHeader {
/// Creates a new block header.
#[allow(clippy::too_many_arguments)]
pub fn new(
version: u32,
prev_hash: Digest,
block_num: u32,
chain_root: Digest,
account_root: Digest,
nullifier_root: Digest,
note_root: Digest,
tx_hash: Digest,
proof_hash: Digest,
timestamp: u32,
) -> Self {
// compute block sub hash
let sub_hash = Self::compute_sub_hash(
version,
prev_hash,
chain_root,
account_root,
nullifier_root,
tx_hash,
proof_hash,
timestamp,
block_num,
);
// The sub hash is merged with the note_root - hash(sub_hash, note_root) to produce the
// final hash. This is done to make the note_root easily accessible without having
// to unhash the entire header. Having the note_root easily accessible is useful
// when authenticating notes.
let hash = Hasher::merge(&[sub_hash, note_root]);
Self {
version,
prev_hash,
block_num,
chain_root,
account_root,
nullifier_root,
note_root,
tx_hash,
proof_hash,
timestamp,
sub_hash,
hash,
}
}
// ACCESSORS
// --------------------------------------------------------------------------------------------
/// Returns the protocol version.
pub fn version(&self) -> u32 {
self.version
}
/// Returns the hash of the block header.
pub fn hash(&self) -> Digest {
self.hash
}
/// Returns the sub hash of the block header. The sub hash is a sequential hash of all block
/// header fields except the note root. This is used in the block hash computation which is a
/// 2-to-1 hash of the sub hash and the note root [hash(sub_hash, note_root)]. This procedure
/// is used to make the note root easily accessible without having to unhash the entire header.
pub fn sub_hash(&self) -> Digest {
self.sub_hash
}
/// Returns the hash of the previous block header.
pub fn prev_hash(&self) -> Digest {
self.prev_hash
}
/// Returns the block number.
pub fn block_num(&self) -> u32 {
self.block_num
}
/// Returns the chain root.
pub fn chain_root(&self) -> Digest {
self.chain_root
}
/// Returns the account database root.
pub fn account_root(&self) -> Digest {
self.account_root
}
/// Returns the nullifier database root.
pub fn nullifier_root(&self) -> Digest {
self.nullifier_root
}
/// Returns the note root.
pub fn note_root(&self) -> Digest {
self.note_root
}
/// Returns the commitment to all transactions in this block.
///
/// The commitment is computed as sequential hash of (`transaction_id`, `account_id`) tuples.
/// This makes it possible for the verifier to link transaction IDs to the accounts which
/// they were executed against.
pub fn tx_hash(&self) -> Digest {
self.tx_hash
}
/// Returns the proof hash.
pub fn proof_hash(&self) -> Digest {
self.proof_hash
}
/// Returns the timestamp at which the block was created, in seconds since UNIX epoch.
pub fn timestamp(&self) -> u32 {
self.timestamp
}
// HELPERS
// --------------------------------------------------------------------------------------------
/// Computes the sub hash of the block header.
///
/// The sub hash is computed as a sequential hash of the following fields:
/// `prev_hash`, `chain_root`, `account_root`, `nullifier_root`, `note_root`, `tx_hash`,
/// `proof_hash`, `version`, `timestamp`, `block_num` (all fields except the `note_root`).
#[allow(clippy::too_many_arguments)]
fn compute_sub_hash(
version: u32,
prev_hash: Digest,
chain_root: Digest,
account_root: Digest,
nullifier_root: Digest,
tx_hash: Digest,
proof_hash: Digest,
timestamp: u32,
block_num: u32,
) -> Digest {
let mut elements: Vec<Felt> = Vec::with_capacity(32);
elements.extend_from_slice(prev_hash.as_elements());
elements.extend_from_slice(chain_root.as_elements());
elements.extend_from_slice(account_root.as_elements());
elements.extend_from_slice(nullifier_root.as_elements());
elements.extend_from_slice(tx_hash.as_elements());
elements.extend_from_slice(proof_hash.as_elements());
elements.extend([block_num.into(), version.into(), timestamp.into(), ZERO]);
elements.resize(32, ZERO);
Hasher::hash_elements(&elements)
}
}
impl Serializable for BlockHeader {
fn write_into<W: ByteWriter>(&self, target: &mut W) {
self.version.write_into(target);
self.prev_hash.write_into(target);
self.block_num.write_into(target);
self.chain_root.write_into(target);
self.account_root.write_into(target);
self.nullifier_root.write_into(target);
self.note_root.write_into(target);
self.tx_hash.write_into(target);
self.proof_hash.write_into(target);
self.timestamp.write_into(target);
}
}
impl Deserializable for BlockHeader {
fn read_from<R: ByteReader>(source: &mut R) -> Result<Self, DeserializationError> {
let version = source.read()?;
let prev_hash = source.read()?;
let block_num = source.read()?;
let chain_root = source.read()?;
let account_root = source.read()?;
let nullifier_root = source.read()?;
let note_root = source.read()?;
let tx_hash = source.read()?;
let proof_hash = source.read()?;
let timestamp = source.read()?;
Ok(Self::new(
version,
prev_hash,
block_num,
chain_root,
account_root,
nullifier_root,
note_root,
tx_hash,
proof_hash,
timestamp,
))
}
}
#[cfg(test)]
mod tests {
use vm_core::Word;
use winter_rand_utils::rand_array;
use super::*;
#[test]
fn test_serde() {
let chain_root: Word = rand_array();
let note_root: Word = rand_array();
let header = BlockHeader::mock(0, Some(chain_root.into()), Some(note_root.into()), &[]);
let serialized = header.to_bytes();
let deserialized = BlockHeader::read_from_bytes(&serialized).unwrap();
assert_eq!(deserialized, header);
}
}