OGGlossary OSVocabulario de Solana reconstruido para builders.
ENPT-BRES
Protocolo Base

Alpenglow

A next-generation consensus protocol proposed in SIMD-0326 that aims to collapse Solana's legacy systems (Proof of History, Tower BFT, gossip-based vote propagation) into two streamlined mechanisms: Rotor for data propagation and Votor for off-chain voting. Alpenglow targets reducing transaction finality from ~12.8 seconds to under 150 milliseconds, representing the most significant consensus overhaul in Solana's history.

IDalpenglowAliasSIMD-326
Lectura rápida

Lectura rápida

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

A next-generation consensus protocol proposed in SIMD-0326 that aims to collapse Solana's legacy systems (Proof of History, Tower BFT, gossip-based vote propagation) into two streamlined mechanisms: Rotor for data propagation and Votor for off-chain voting. Alpenglow targets reducing transaction finality from ~12.8 seconds to under 150 milliseconds, representing the most significant consensus overhaul in Solana's history.

Modelo mental

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 parte del engranaje que mantiene funcionando el orden, la ejecución o el consenso de la red.

Contexto técnico

Contexto técnico

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

Consenso, rotación de líderes, slots, epochs y el runtime.

Por qué le importa a un builder

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.

Alpenglow (alpenglow)
Categoría: Protocolo Base
Definición: A next-generation consensus protocol proposed in SIMD-0326 that aims to collapse Solana's legacy systems (Proof of History, Tower BFT, gossip-based vote propagation) into two streamlined mechanisms: Rotor for data propagation and Votor for off-chain voting. Alpenglow targets reducing transaction finality from ~12.8 seconds to under 150 milliseconds, representing the most significant consensus overhaul in Solana's history.
Aliases: SIMD-326
Relacionados: Mecanismo de Consenso, Finalidad, Tower BFT, Prueba de Historia (PoH)
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

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.

Prueba de Participación (PoS)Prueba de Trabajo (PoW)
Abrir término
Rama

Finalidad

The guarantee that a transaction cannot be reversed. Solana offers two levels: optimistic confirmation (~400ms, 66.7%+ stake voted) and full finality (~12-13 seconds, 31+ confirmations rooted). Once a slot is rooted, its transactions are irreversible under the assumption that no more than 1/3 of stake is malicious.

ConfirmationConfirmación Optimista
Abrir término
Rama

Tower BFT

Solana's custom BFT consensus algorithm built on top of Proof of History. Tower BFT uses PoH as a clock to reduce communication overhead in traditional PBFT from O(n²) to O(n). Validators vote on forks with exponentially increasing lockout periods—each consecutive vote doubles the lockout, making rollbacks progressively more expensive. A fork is finalized when it reaches supermajority (66.7%+ of stake).

Cuenta de VotoFork
Abrir término
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.

SlotCalendario de Líderes
Abrir término
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.

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.

Abrir término
Protocolo Base

Finalidad

The guarantee that a transaction cannot be reversed. Solana offers two levels: optimistic confirmation (~400ms, 66.7%+ stake voted) and full finality (~12-13 seconds, 31+ confirmations rooted). Once a slot is rooted, its transactions are irreversible under the assumption that no more than 1/3 of stake is malicious.

Abrir término
Protocolo Base

Tower BFT

Solana's custom BFT consensus algorithm built on top of Proof of History. Tower BFT uses PoH as a clock to reduce communication overhead in traditional PBFT from O(n²) to O(n). Validators vote on forks with exponentially increasing lockout periods—each consecutive vote doubles the lockout, making rollbacks progressively more expensive. A fork is finalized when it reaches supermajority (66.7%+ of stake).

Abrir término
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.

Abrir término
Comúnmente confundido con

Términos cercanos en vocabulario, acrónimo o vecindad conceptual.

Estas entradas son fáciles de mezclar cuando lees rápido, haces prompting a un LLM o estás entrando en una nueva capa de Solana.

Protocolo Basealpenglow-certificate

Alpenglow Certificate

A fast finality certificate produced by the Alpenglow consensus protocol when a supermajority of validators (66.7%+ of stake) have attested to a block through Votor's off-chain voting mechanism. Once an Alpenglow certificate is formed, the block is considered final, reducing finality time from Tower BFT's ~12.8 seconds to a target of under 150 milliseconds. Certificates are compact proofs of consensus that can be verified by any node.

Abrir término
Protocolo Baseaccounts-db

AccountsDB

The persistent storage layer for all Solana accounts. AccountsDB stores account data in memory-mapped AppendVec files, indexed by pubkey and slot. It supports fast lookups, handles account deduplication across slots, and periodically cleans up dead accounts. AccountsDB is the largest consumer of validator disk space.

AliasAccountsDb
Abrir término
Protocolo Baseagave

Agave

The Rust-based Solana validator client maintained by Anza (formerly Solana Labs). Agave is the original and most widely deployed validator implementation. It handles all aspects of validation: TPU, TVU, gossip, AccountsDB, and RPC. The name 'Agave' was adopted to distinguish it from the Firedancer client.

AliasAnza Agave
Abrir término
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.

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.

Abrir término
Protocolo Basefinality

Finalidad

The guarantee that a transaction cannot be reversed. Solana offers two levels: optimistic confirmation (~400ms, 66.7%+ stake voted) and full finality (~12-13 seconds, 31+ confirmations rooted). Once a slot is rooted, its transactions are irreversible under the assumption that no more than 1/3 of stake is malicious.

Abrir término
Protocolo Basetower-bft

Tower BFT

Solana's custom BFT consensus algorithm built on top of Proof of History. Tower BFT uses PoH as a clock to reduce communication overhead in traditional PBFT from O(n²) to O(n). Validators vote on forks with exponentially increasing lockout periods—each consecutive vote doubles the lockout, making rollbacks progressively more expensive. A fork is finalized when it reaches supermajority (66.7%+ of stake).

Abrir término
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.

Abrir término
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.

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.

Abrir término
Protocolo Base

Tower BFT

Solana's custom BFT consensus algorithm built on top of Proof of History. Tower BFT uses PoH as a clock to reduce communication overhead in traditional PBFT from O(n²) to O(n). Validators vote on forks with exponentially increasing lockout periods—each consecutive vote doubles the lockout, making rollbacks progressively more expensive. A fork is finalized when it reaches supermajority (66.7%+ of stake).

Abrir término
Protocolo Base

Slot

A time window during which a designated leader validator can produce a block. Each slot lasts approximately 400 milliseconds. Slots are numbered sequentially from genesis and grouped into epochs of 432,000 slots (~2-3 days). Not every slot produces a block—a skipped slot means the leader was offline or too slow.

Abrir término
Protocolo Base

Bloque

A set of entries produced by a leader during a single slot. A block contains transactions bundled into entries, each with a PoH hash proving ordering. Blocks are broken into shreds for network propagation via Turbine. Maximum block size is limited by compute units (48M CU cap per block) rather than byte size.

Abrir término