The following terms are used throughout this book.
A front-end application that interacts with a Solana cluster.
Smallest encrypted chunk of ledger, an encrypted ledger segment would be made of
many CBC blocks.
ledger_segment_size / cbc_block_size to be exact.
A multicast network used to efficiently validate entries and gain consensus.
An off-chain service that acts as a custodian for a user's private key. It typically serves to validate and sign transactions.
A proof which has the same format as a storage proof, but the sha state is actually from hashing a known ledger value which the storage client can reveal and is also easily verifiable by the network on-chain.
A globally unique identifier that is also a proof that the entry was generated after a duration of time, all transactions included in the entry, and all previous entries on the ledger. See Proof of History.
When nodes representing 2/3rd of the stake have a common root.
A ledger derived from common entries but then diverged.
A digital fingerprint of a sequence of bytes.
A program with the ability to interpret the binary encoding of other on-chain programs.
Portion of the ledger which is downloaded by the replicator where storage proof data is derived.
A hash of the fullnode's state at a given tick height. It comprises a validator's affirmation that a block it has received has been verified, as well as a promise not to vote for a conflicting block (i.e. fork) for a specific amount of time, the lockout period.
A computer participating in a cluster.
See Proof of History.
The code that interprets instructions.
A stack of proofs, each which proves that some data existed before the proof was created and that a precise duration of time passed before the previous proof. Like a VDF, a Proof of History can be verified in less time than it took to produce.
The public key of a keypair.
Storage mining client, stores some part of the ledger enumerated in blocks and submits storage proofs to the chain. Not a full-node.
A block or slot that has reached maximum lockout on a validator. The root is the highest block that is an ancestor of all active forks on a validator. All ancestor blocks of a root are also transitively a root. Blocks that are not an ancestor and not a descendant of the root are excluded from consideration for consensus and can be discarded.
The private key of a keypair.
A set of sha hash state which is constructed by sampling the encrypted version of the stored ledger segment at certain offsets.
A transaction from a replicator that verifiably proves that a validator confirmed a fake proof.
A transaction from a validator which is after the timeout period given from the storage proof confirmation and which no successful challenges have been observed which rewards the parties of the storage proofs and confirmations.
A transaction by a validator which indicates the set of real and fake proofs submitted by a storage miner. The transaction would contain a list of proof hash values and a bit which says if this hash is valid or fake.
The number of keys and samples that a validator can verify each storage epoch.
A ledger entry that estimates wallclock duration.
A scarce, fungible member of a set of tokens.
Transactions per second.
A set of transactions that may be executed in parallel.
A function that takes a fixed amount of time to execute that produces a proof that it ran, which can then be verified in less time than it took to produce.
See ledger vote.