Struct TreeHead 

pub struct TreeHead {
    pub size: u64,
    pub root: String,
    pub at_unix_ms: i64,
}

What a log signs: how many records it holds and what they hash to.

The pair is the claim. A root alone says nothing about when — the same root can be reissued for ever — and a size alone is not a commitment to content. Together they say: at this moment I held exactly these N records, in this order.

Fields

size: u64

How many records the log held.

root: String

root over those records, hex.

at_unix_ms: i64

When the head was issued.

Implementations

impl TreeHead

pub fn signing_bytes(&self) -> Vec<u8>

The exact bytes that are signed.

A fixed, line-oriented rendering rather than the JSON: JSON has no canonical form, so signing the serialisation would make the signature depend on a serialiser’s field order. Three lines and a label cannot drift.

Trait Implementations

impl Clone for TreeHead

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for TreeHead

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for TreeHead

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for TreeHead

impl PartialEq for TreeHead

fn eq(&self, other: &Self) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl Serialize for TreeHead

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for TreeHead