- Leader and Proof of History
- State
- Verifier and State Replication
- Validators

Components

The leader is expected to take in incoming user packets and efficiently order them into a proof of history sequence, which is then published to downstream verifiers. Efficiency is determined based on the memory access patterns of the transactions, so transactions are ordered to minimize faults and maximize prefetching. 

Network Limits

Each transaction needs a digest verification. Because it does not use any memory outside the transaction message itself, the operation can be parallelized independently. Output is therefore limited by the number of cores in the system. 

Computational Limits

A naïve implementation of the state would theoretically fit 10 billion accounts into 640 GB. Based on 2 reads and 2 writes per transaction, memory throughput can handle 2.75 million transactions per second.

Memory Limits

Smart contracts are a generalized form of transactions. They are programs running on each node to modify the state. One of its advantages is a zero cost foreign function interface intrinsic, which are functions implemented on the platform directly and therefore callable by programs. Calling the intrinsic suspends that program and schedules the intrinsic on a higher performance server. 

High Performance Smart Contracts

- Components
- Network Limits
- Computational Limits
- Memory Limits
- High Performance Smart Contracts 

University of Connecticut

Solana is a decentralized, open blockchain that uses a combination of Proof-of-History and Proof-of-Stake to allow for low cost transactions. This combination also permits high speed transactions while maintaining a safe, decentralized ecosystem.

Solana

Solana - A new architecture for a high performance blockchain

- Proof of History (POH)
-Tower BFT
-Turbine
-Gulf Stream
-Sealevel
-Pipelining
-Cloudbreak
-Archivers

Innovations

Solana reaches high-throughput consensus by combining several interlocking subsystems. Validators organize into clusters and synchronize using Proof of History timestamps, while leader rotation designates a single validator at a time to produce ledger entries. When connectivity to a leader is lost, the cluster tolerates fork generation, and a leader assigned to a fork must see it through rather than switching forks. Turbine propagates blocks efficiently across the cluster with minimal duplicate messages, secure vote signing isolates the vote-casting logic to protect validators from having their stake slashed for forged votes, and stake delegation lets token holders share in rewards for helping secure the network.

How Solana Works

A system in which those of the chain can prove that they are contributing unique resources to the chain. Though it is not a consensus model, it combines with consensus models to create a more secure network.

Learn Before

Related

Learn After

Learn After

Related