A block that has reached maximum lockout depth in Tower BFT, meaning 31 or more consecutive confirmations have been built on top of it. Once a block becomes a root, it and all its ancestors are considered irreversibly finalized. The root corresponds to the 'finalized' commitment level in RPC queries and advances monotonically as the cluster processes new blocks.
Comece pela explicação mais curta e útil antes de aprofundar.
A block that has reached maximum lockout depth in Tower BFT, meaning 31 or more consecutive confirmations have been built on top of it. Once a block becomes a root, it and all its ancestors are considered irreversibly finalized. The root corresponds to the 'finalized' commitment level in RPC queries and advances monotonically as the cluster processes new blocks.
Use primeiro a analogia curta para raciocinar melhor sobre o termo quando ele aparecer em código, docs ou prompts.
Pense nisso como parte da engrenagem que mantém a ordenação, execução ou consenso da rede funcionando.
Coloque o termo dentro da camada de Solana em que ele vive para raciocinar melhor sobre ele.
Consenso, rotação de líderes, slots, epochs e o runtime.
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.
Use este bloco compacto quando quiser dar contexto aterrado para um agente ou assistente sem despejar a página inteira.
Raiz (root) Categoria: Protocolo Base Definição: A block that has reached maximum lockout depth in Tower BFT, meaning 31 or more consecutive confirmations have been built on top of it. Once a block becomes a root, it and all its ancestors are considered irreversibly finalized. The root corresponds to the 'finalized' commitment level in RPC queries and advances monotonically as the cluster processes new blocks. Relacionados: Rooted, Finalidade, Tower BFT, Lockout
Use contexto do glossário, relações entre termos, modelos mentais e builder paths para receber respostas estruturadas em vez de output genérico.
Opcional: cole código Anchor, Solana ou Rust para o Copilot mapear primitivas de volta para termos do glossário.
O Copilot vai responder usando o termo atual, conceitos relacionados, modelos mentais e o grafo ao redor do glossário.
Esses ramos mostram quais conceitos esse termo toca diretamente e o que existe uma camada além deles.
A slot that has been finalized by achieving maximum lockout in Tower BFT—meaning 31+ consecutive confirmations have been built on top of it. Once rooted, a slot and its transactions are considered irreversible. Rooted corresponds to the 'finalized' commitment level and takes approximately 12-13 seconds.
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.
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).
The period during which a Tower BFT vote prevents a validator from switching to a competing fork. Lockouts double with each consecutive confirmation: vote depth 1 = 2-slot lockout, depth 2 = 4 slots, etc. This exponential lockout makes it increasingly expensive for validators to change their vote, providing economic finality.
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.
Essas entradas são fáceis de misturar quando você lê rápido, faz prompting em um LLM ou está entrando em uma nova camada de Solana.
A slot that has been finalized by achieving maximum lockout in Tower BFT—meaning 31+ consecutive confirmations have been built on top of it. Once rooted, a slot and its transactions are considered irreversible. Rooted corresponds to the 'finalized' commitment level and takes approximately 12-13 seconds.
The component of the SVM responsible for loading programs, enforcing account access rules (ownership, writability, signer checks), managing compute budgets, and executing transactions. The runtime ensures programs can only modify accounts they own, charges rent, and enforces the 10MB per-transaction account data limit.
Entradas de glossário só ficam úteis quando estão conectadas. Esses links são o caminho mais curto para ideias adjacentes.
A slot that has been finalized by achieving maximum lockout in Tower BFT—meaning 31+ consecutive confirmations have been built on top of it. Once rooted, a slot and its transactions are considered irreversible. Rooted corresponds to the 'finalized' commitment level and takes approximately 12-13 seconds.
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.
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).
The period during which a Tower BFT vote prevents a validator from switching to a competing fork. Lockouts double with each consecutive confirmation: vote depth 1 = 2-slot lockout, depth 2 = 4 slots, etc. This exponential lockout makes it increasingly expensive for validators to change their vote, providing economic finality.
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.
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.
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).
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.
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.