Fundamentos de Programação

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

Leitura rápida

Comece pela explicação mais curta e útil antes de aprofundar.

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.

Modelo mental

Use primeiro a analogia curta para raciocinar melhor sobre o termo quando ele aparecer em código, docs ou prompts.

Pense nisso como um bloco de construção que ajuda a ligar uma definição isolada ao sistema maior onde ela vive.

Contexto técnico

Coloque o termo dentro da camada de Solana em que ele vive para raciocinar melhor sobre ele.

Serialização, memória, estruturas de dados e bases de engenharia.

Por que builders ligam para isso

Transforme o termo de vocabulário em algo operacional para produto e engenharia.

Este termo destrava conceitos adjacentes rapidamente, então funciona melhor quando você o trata como um ponto de conexão, não como definição isolada.

Handoff para IA

Handoff para IA

Use este bloco compacto quando quiser dar contexto aterrado para um agente ou assistente sem despejar a página inteira.

Lamport Timestamp (lamport-timestamp)
Categoria: Fundamentos de Programação
Definição: 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
Relacionados: Prova de História (PoH), Cadeia de Hash SHA-256, Mecanismo de Consenso
Glossary Copilot

Faça perguntas de Solana com contexto aterrado sem sair do glossário.

Use contexto do glossário, relações entre termos, modelos mentais e builder paths para receber respostas estruturadas em vez de output genérico.

Explicar este código

Opcional: cole código Anchor, Solana ou Rust para o Copilot mapear primitivas de volta para termos do glossário.

Faça uma pergunta aterrada no glossário

Faça uma pergunta aterrada no glossário

O Copilot vai responder usando o termo atual, conceitos relacionados, modelos mentais e o grafo ao redor do glossário.

Grafo conceitual

Veja o termo como parte de uma rede, não como uma definição sem saída.

Esses ramos mostram quais conceitos esse termo toca diretamente e o que existe uma camada além deles.

Ramo

Prova de História (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.

Ramo

Cadeia de Hash SHA-256

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.

Ramo

Mecanismo de Consenso

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.

Próximos conceitos para explorar

Continue a cadeia de aprendizado em vez de parar em uma única definição.

Estes são os próximos conceitos que valem abrir se você quiser que este termo faça mais sentido dentro de um workflow real de Solana.

Protocolo Base

Prova de História (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.

Protocolo Base

Cadeia de Hash SHA-256

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 Geral

Mecanismo de Consenso

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.

Fundamentos de Programação

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).

Termos relacionados

Siga os conceitos que realmente dão contexto a este termo.

Entradas de glossário só ficam úteis quando estão conectadas. Esses links são o caminho mais curto para ideias adjacentes.

Protocolo Baseproof-of-history

Prova de História (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.

Protocolo Basesha256-hash-chain

Cadeia de Hash SHA-256

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 Geralconsensus

Mecanismo de Consenso

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.

Mais na categoria

Permaneça na mesma camada e continue construindo contexto.

Essas entradas vivem ao lado do termo atual e ajudam a página a parecer parte de um grafo maior, não um beco sem saída.

Fundamentos de Programação

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.

Fundamentos de Programação

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.

Fundamentos de Programação

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.

Fundamentos de Programação

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.