Struct Entry

Source

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

👎Deprecated since 3.1.0: This crate has been marked for formal inclusion in the Agave Unstable API. From v4.0.0 onward, the agave-unstable-api crate feature must be specified to acknowledge use of an interface that may break without warning.

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 multiply 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!)

The solana core protocol currently requires an Entry to contain transactions that are executable in parallel. Implemented in:

For TPU: solana_core::banking_stage::BankingStage::process_and_record_transactions()
For TVU: solana_core::replay_stage::ReplayStage::replay_blockstore_into_bank()

Until SIMD83 is activated: All transactions in the transactions field have to follow the read/write locking restrictions with regard to the accounts they reference. A single account can be either written by a single transaction, or read by one or more transactions, but not both. This enforcement is done via a call to solana_runtime::accounts::Accounts::lock_accounts() with the txs argument holding all the transactions in the Entry.

Fields§

§num_hashes: u64

👎Deprecated since 3.1.0: This crate has been marked for formal inclusion in the Agave Unstable API. From v4.0.0 onward, the agave-unstable-api crate feature must be specified to acknowledge use of an interface that may break without warning.

The number of hashes since the previous Entry ID.

§hash: Hash

👎Deprecated since 3.1.0: This crate has been marked for formal inclusion in the Agave Unstable API. From v4.0.0 onward, the agave-unstable-api crate feature must be specified to acknowledge use of an interface that may break without warning.

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

§transactions: Vec<VersionedTransaction>

👎Deprecated since 3.1.0: This crate has been marked for formal inclusion in the Agave Unstable API. From v4.0.0 onward, the agave-unstable-api crate feature must be specified to acknowledge use of an interface that may break without warning.

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.

Struct Entry Copy item path

Fields§

Implementations§

impl Entry

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

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

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

pub fn is_tick(&self) -> bool

Trait Implementations§

impl Clone for Entry

fn clone(&self) -> Entry

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

impl Debug for Entry

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

impl Default for Entry

fn default() -> Entry

impl<'de> Deserialize<'de> for Entry

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

impl From<&Entry> for EntrySummary

fn from(entry: &Entry) -> Self

impl PartialEq for Entry

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

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

impl<'de> SchemaRead<'de> for Entry

type Dst = Entry

fn read( reader: &mut Reader<'de>, dst: &mut MaybeUninit<Self::Dst>, ) -> ReadResult<()>

fn get(reader: &mut Reader<'de>) -> Result<Self::Dst, ReadError>

impl SchemaWrite for Entry

type Src = Entry

fn size_of(src: &Self::Src) -> WriteResult<usize>

fn write(writer: &mut Writer<'_>, src: &Self::Src) -> WriteResult<()>

impl Serialize for Entry

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

impl Eq for Entry

impl StructuralPartialEq for Entry

Auto Trait Implementations§

impl Freeze for Entry

impl RefUnwindSafe for Entry

impl Send for Entry

impl Sync for Entry

impl Unpin for Entry

impl UnwindSafe for Entry

Blanket Implementations§

impl<T> Any for Twhere T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> Borrow<T> for Twhere T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for Twhere T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

impl<T> CloneToUninit for Twhere T: Clone,

unsafe fn clone_to_uninit(&self, dest: *mut u8)

impl<'de, T> Deserialize<'de> for Twhere T: SchemaRead<'de>,

fn deserialize(bytes: &'de [u8]) -> Result<Self::Dst, ReadError>

fn deserialize_into( bytes: &'de [u8], target: &mut MaybeUninit<Self::Dst>, ) -> Result<(), ReadError>

impl<T> Encode for Twhere T: Serialize + ?Sized,

fn encode<W>(&self, writer: W) -> Result<(), Box<ErrorKind>>where W: Write,

impl<T> From<T> for T

fn from(t: T) -> T

impl<T> Instrument for T

fn instrument(self, span: Span) -> Instrumented<Self>

fn in_current_span(self) -> Instrumented<Self>

impl<T, U> Into<U> for Twhere U: From<T>,

fn into(self) -> U

impl<T> IntoEither for T

fn into_either(self, into_left: bool) -> Either<Self, Self>

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>where F: FnOnce(&Self) -> bool,

impl<T> Pointable for T

const ALIGN: usize

type Init = T

unsafe fn init(init: <T as Pointable>::Init) -> usize

unsafe fn deref<'a>(ptr: usize) -> &'a T

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

unsafe fn drop(ptr: usize)

impl<T> PolicyExt for Twhere T: ?Sized,

fn and<P, B, E>(self, other: P) -> And<T, P>where T: Policy<B, E>, P: Policy<B, E>,

fn or<P, B, E>(self, other: P) -> Or<T, P>where T: Policy<B, E>, P: Policy<B, E>,

impl<T> Same for T

type Output = T

impl<T> Serialize for Twhere T: SchemaWrite + ?Sized,

fn serialize(src: &Self::Src) -> Result<Vec<u8>, WriteError>

Struct Entry

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
where __D: Deserializer<'de>,

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
where S: Serializer,

impl<T> Any for T
where T: 'static + ?Sized,

impl<T> Borrow<T> for T
where T: ?Sized,

impl<T> BorrowMut<T> for T
where T: ?Sized,

impl<T> CloneToUninit for T
where T: Clone,

impl<'de, T> Deserialize<'de> for T
where T: SchemaRead<'de>,

impl<T> Encode for T
where T: Serialize + ?Sized,

fn encode<W>(&self, writer: W) -> Result<(), Box<ErrorKind>>
where W: Write,

impl<T, U> Into<U> for T
where U: From<T>,

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

impl<T> PolicyExt for T
where T: ?Sized,

fn and<P, B, E>(self, other: P) -> And<T, P>
where T: Policy<B, E>, P: Policy<B, E>,

fn or<P, B, E>(self, other: P) -> Or<T, P>
where T: Policy<B, E>, P: Policy<B, E>,

impl<T> Serialize for T
where T: SchemaWrite + ?Sized,

impl<T> ToOwned for T
where T: Clone,

impl<T, U> TryFrom<U> for T
where U: Into<T>,

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

impl<T> DeserializeOwned for T
where T: for<'de> Deserialize<'de>,

impl<T> ErasedDestructor for T
where T: 'static,