Struct solana_ledger::entry::Entry

[+] Show declaration

pub struct Entry {
    pub num_hashes: u64,
    pub hash: Hash,
    pub transactions: Vec<Transaction>,
}

[−] Expand description

Each Entry contains three pieces of data. The num_hashes field is the number of hashes performed since the previous entry. The hash field is the result of hashing hash from the previous entry num_hashes times. The transactions field points to Transactions that took place shortly before hash was generated.

If you divide num_hashes by the amount of time it takes to generate a new hash, you get a duration estimate since the last Entry. Since processing power increases over time, one should expect the duration num_hashes represents to decrease proportionally. An upper bound on Duration can be estimated by assuming each hash was generated by the world’s fastest processor at the time the entry was recorded. Or said another way, it is physically not possible for a shorter duration to have occurred if one assumes the hash was computed by the world’s fastest processor at that time. The hash chain is both a Verifiable Delay Function (VDF) and a Proof of Work (not to be confused with Proof of Work consensus!)

Fields

num_hashes: u64

[−] Expand description

The number of hashes since the previous Entry ID.

hash: Hash

[−] Expand description

The SHA-256 hash num_hashes after the previous Entry ID.

transactions: Vec<Transaction>

[−] Expand description

An unordered list of transactions that were observed before the Entry ID was generated. They may have been observed before a previous Entry ID but were pushed back into this list to ensure deterministic interpretation of the ledger.

Implementations

impl Entry[−]

pub fn new(
    prev_hash: &Hash,
    num_hashes: u64,
    transactions: Vec<Transaction>
) -> Self[−]

Creates the next Entry num_hashes after start_hash.

pub fn new_mut(
    start_hash: &mut Hash,
    num_hashes: &mut u64,
    transactions: Vec<Transaction>
) -> Self

pub fn verify(&self, start_hash: &Hash) -> bool[−]

Verifies self.hash is the result of hashing a start_hash self.num_hashes times. If the transaction is not a Tick, then hash that as well.

pub fn is_tick(&self) -> bool

Trait Implementations

impl Clone for Entry[+]

[+] Show hidden undocumented items

fn clone(&self) -> Entry[−]

Returns a copy of the value.

pub fn clone_from(&mut self, source: &Self)[−]

Performs copy-assignment from source.

impl Debug for Entry[+]

[+] Show hidden undocumented items

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

Formats the value using the given formatter.

impl Default for Entry[+]

[+] Show hidden undocumented items

fn default() -> Entry[−]

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for Entry[+]

[+] Show hidden undocumented items

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
    __D: Deserializer<'de>, [−]

Deserialize this value from the given Serde deserializer.

impl Eq for Entry

impl PartialEq<Entry> for Entry[+]

[+] Show hidden undocumented items

fn eq(&self, other: &Entry) -> bool[−]

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Entry) -> bool[−]

This method tests for !=.

impl Serialize for Entry[+]

[+] Show hidden undocumented items

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error> where
    __S: Serializer, [−]

Serialize this value into the given Serde serializer.

impl StructuralEq for Entry

impl StructuralPartialEq for Entry