Programming Fundamentals

Lamport Timestamp

Logical clock mechanism proposed by Leslie Lamport (1978) for ordering events in distributed systems without synchronized physical clocks. Solana's Proof of History extends this concept by using a SHA-256 hash chain as a verifiable, cryptographic logical clock, creating a global ordering of events without requiring validators to communicate timestamps.

IDlamport-timestampAliasLogical Clock

Plain meaning

Start with the shortest useful explanation before going deeper.

Logical clock mechanism proposed by Leslie Lamport (1978) for ordering events in distributed systems without synchronized physical clocks. Solana's Proof of History extends this concept by using a SHA-256 hash chain as a verifiable, cryptographic logical clock, creating a global ordering of events without requiring validators to communicate timestamps.

Mental model

Use the quick analogy first so the term is easier to reason about when you meet it in code, docs, or prompts.

Think of it as a building block that connects one definition to the larger Solana system around it.

Technical context

Place the term inside its Solana layer so the definition is easier to reason about.

Serialization, memory, data structures, and core engineering basics.

Why builders care

Turn the term from vocabulary into something operational for product and engineering work.

This term unlocks adjacent concepts quickly, so it works best when you treat it as a junction instead of an isolated definition.

AI handoff

AI handoff

Use this compact block when you want to give an agent or assistant grounded context without dumping the entire page.

Lamport Timestamp (lamport-timestamp)
Category: Programming Fundamentals
Definition: Logical clock mechanism proposed by Leslie Lamport (1978) for ordering events in distributed systems without synchronized physical clocks. Solana's Proof of History extends this concept by using a SHA-256 hash chain as a verifiable, cryptographic logical clock, creating a global ordering of events without requiring validators to communicate timestamps.
Aliases: Logical Clock
Related: Proof of History (PoH), SHA-256 Hash Chain, Consensus Mechanism
Glossary Copilot

Ask grounded Solana questions without leaving the glossary.

Use glossary context, relationships, mental models, and builder paths to get structured answers instead of generic chat output.

Explain this code

Optional: paste Anchor, Solana, or Rust code so the Copilot can map primitives back to glossary terms.

Ask a glossary-grounded question

Ask a glossary-grounded question

The Copilot will answer using the current term, related concepts, mental models, and the surrounding glossary graph.

Concept graph

See the term as part of a network, not a dead-end definition.

These branches show which concepts this term touches directly and what sits one layer beyond them.

Branch

Proof of History (PoH)

A clock mechanism that cryptographically proves the passage of time between events. PoH uses a sequential SHA-256 hash chain where each output becomes the next input, creating a verifiable ordering of events without requiring consensus. The leader produces ~400,000 hashes per slot (~400ms), and any validator can verify the sequence in parallel, enabling Solana's high throughput by removing the need for validators to agree on time.

Branch

SHA-256 Hash Chain

The core mechanism of Proof of History. A SHA-256 hash is computed sequentially—each hash takes the previous hash as input—creating an ordered, unforgeable timestamp sequence. The PoH generator runs approximately 400,000 hashes per slot. Data (transactions) can be inserted into the chain by mixing their hash with the current state.

Branch

Consensus Mechanism

The protocol by which nodes in a distributed network agree on the current state of the ledger. Common mechanisms include Proof of Work (Bitcoin), Proof of Stake (Ethereum, Solana), and BFT variants. Consensus ensures all honest nodes converge on the same transaction history despite potential network delays or malicious actors.

Next concepts to explore

Keep the learning chain moving instead of stopping at one definition.

These are the next concepts worth opening if you want this term to make more sense inside a real Solana workflow.

Core Protocol

Proof of History (PoH)

A clock mechanism that cryptographically proves the passage of time between events. PoH uses a sequential SHA-256 hash chain where each output becomes the next input, creating a verifiable ordering of events without requiring consensus. The leader produces ~400,000 hashes per slot (~400ms), and any validator can verify the sequence in parallel, enabling Solana's high throughput by removing the need for validators to agree on time.

Core Protocol

SHA-256 Hash Chain

The core mechanism of Proof of History. A SHA-256 hash is computed sequentially—each hash takes the previous hash as input—creating an ordered, unforgeable timestamp sequence. The PoH generator runs approximately 400,000 hashes per slot. Data (transactions) can be inserted into the chain by mixing their hash with the current state.

Blockchain General

Consensus Mechanism

The protocol by which nodes in a distributed network agree on the current state of the ledger. Common mechanisms include Proof of Work (Bitcoin), Proof of Stake (Ethereum, Solana), and BFT variants. Consensus ensures all honest nodes converge on the same transaction history despite potential network delays or malicious actors.

Programming Fundamentals

Little-Endian

A byte ordering convention where the least significant byte is stored at the lowest memory address. Solana uses little-endian byte order for all on-chain data serialization (Borsh defaults to little-endian), matching the native byte order of x86/ARM CPUs that run validators. When manually reading or writing multi-byte integers from account data, developers must use little-endian functions (e.g., u64::from_le_bytes in Rust, readUInt32LE in Node.js).

Related terms

Follow the concepts that give this term its actual context.

Glossary entries become useful when they are connected. These links are the shortest path to adjacent ideas.

Core Protocolproof-of-history

Proof of History (PoH)

A clock mechanism that cryptographically proves the passage of time between events. PoH uses a sequential SHA-256 hash chain where each output becomes the next input, creating a verifiable ordering of events without requiring consensus. The leader produces ~400,000 hashes per slot (~400ms), and any validator can verify the sequence in parallel, enabling Solana's high throughput by removing the need for validators to agree on time.

Core Protocolsha256-hash-chain

SHA-256 Hash Chain

The core mechanism of Proof of History. A SHA-256 hash is computed sequentially—each hash takes the previous hash as input—creating an ordered, unforgeable timestamp sequence. The PoH generator runs approximately 400,000 hashes per slot. Data (transactions) can be inserted into the chain by mixing their hash with the current state.

Blockchain Generalconsensus

Consensus Mechanism

The protocol by which nodes in a distributed network agree on the current state of the ledger. Common mechanisms include Proof of Work (Bitcoin), Proof of Stake (Ethereum, Solana), and BFT variants. Consensus ensures all honest nodes converge on the same transaction history despite potential network delays or malicious actors.

More in category

Stay in the same layer and keep building context.

These entries live beside the current term and help the page feel like part of a larger knowledge graph instead of a dead end.

Programming Fundamentals

Rust

A systems programming language emphasizing memory safety, zero-cost abstractions, and concurrency without a garbage collector. Rust uses an ownership model with borrow checking at compile time to prevent data races and null pointer bugs. It is the primary language for Solana program development (via Anchor or native solana-program crate) and the Agave validator client.

Programming Fundamentals

TypeScript

A statically typed superset of JavaScript that compiles to plain JavaScript. TypeScript adds type annotations, interfaces, generics, and enums to catch errors at compile time. It is the standard language for Solana client-side development—wallet adapters, dApp frontends, test suites, and SDK interactions (web3.js, Anchor client) are typically written in TypeScript.

Programming Fundamentals

JavaScript

The ubiquitous scripting language for web development, running in browsers and Node.js. JavaScript is dynamically typed and event-driven. Most Solana dApp frontends and scripts use JavaScript/TypeScript with libraries like @solana/web3.js. Node.js enables server-side JS for backend services, indexers, and bot development.

Programming Fundamentals

Node.js

A JavaScript runtime built on Chrome's V8 engine that enables server-side JavaScript execution. Node.js uses an event-driven, non-blocking I/O model. In the Solana ecosystem, Node.js is used for: running Anchor tests (Mocha/Jest), backend services, transaction bots, indexers, and CLI tools. npm/yarn/pnpm manage JavaScript package dependencies.