Fundamentos de Programación

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

Lectura rápida

Empieza por la explicación más corta y útil antes de profundizar.

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

Usa primero la analogía corta para razonar mejor sobre el término cuando aparezca en código, docs o prompts.

Piensa en esto como un bloque de construcción que conecta una definición aislada con el sistema mayor donde vive.

Contexto técnico

Ubica el término dentro de la capa de Solana en la que vive para razonar mejor sobre él.

Serialización, memoria, estructuras de datos y bases de ingeniería.

Por qué le importa a un builder

Convierte el término de vocabulario en algo operacional para producto e ingeniería.

Este término desbloquea conceptos adyacentes rápido, así que funciona mejor cuando lo tratas como un punto de conexión y no como una definición aislada.

Handoff para IA

Handoff para IA

Usa este bloque compacto cuando quieras dar contexto sólido a un agente o asistente sin volcar toda la página.

Lamport Timestamp (lamport-timestamp)
Categoría: Fundamentos de Programación
Definición: 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: Prueba de Historia (PoH), Cadena de Hash SHA-256, Mecanismo de Consenso
Glossary Copilot

Haz preguntas de Solana con contexto aterrizado sin salir del glosario.

Usa contexto del glosario, relaciones entre términos, modelos mentales y builder paths para recibir respuestas estructuradas en vez de output genérico.

Abrir workspace completa del Copilot
Explicar este código

Opcional: pega código Anchor, Solana o Rust para que el Copilot mapee primitivas de vuelta al glosario.

Haz una pregunta aterrizada en el glosario

Haz una pregunta aterrizada en el glosario

El Copilot responderá usando el término actual, conceptos relacionados, modelos mentales y el grafo alrededor del glosario.

Grafo conceptual

Ve el término como parte de una red, no como una definición aislada.

Estas ramas muestran qué conceptos toca este término directamente y qué existe una capa más allá de ellos.

Rama

Prueba de Historia (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.

Rama

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

Rama

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.

Siguientes conceptos para explorar

Mantén la cadena de aprendizaje en movimiento en lugar de parar en una sola definición.

Estos son los siguientes conceptos que vale la pena abrir si quieres que este término tenga más sentido dentro de un workflow real de Solana.

Protocolo Base

Prueba de Historia (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

Cadena 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 General

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 Programación

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

Términos relacionados

Sigue los conceptos que realmente le dan contexto a este término.

Las entradas del glosario se vuelven útiles cuando están conectadas. Estos enlaces son el camino más corto hacia ideas adyacentes.

Protocolo Baseproof-of-history

Prueba de Historia (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

Cadena 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 Generalconsensus

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.

Más en la categoría

Quédate en la misma capa y sigue construyendo contexto.

Estas entradas viven junto al término actual y ayudan a que la página se sienta parte de un grafo de conocimiento más amplio en lugar de un callejón sin salida.

Fundamentos de Programación

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 Programación

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 Programación

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 Programación

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.