Greedy Heaviest Observed SubTree—a fork-choice rule where validators select the fork that has the most cumulative stake-weighted votes. Unlike longest-chain rules, GHOST considers all votes in the tree, not just the tip. Solana's implementation weighs votes by stake and factors in Tower BFT lockout periods.
Comece pela explicação mais curta e útil antes de aprofundar.
Greedy Heaviest Observed SubTree—a fork-choice rule where validators select the fork that has the most cumulative stake-weighted votes. Unlike longest-chain rules, GHOST considers all votes in the tree, not just the tip. Solana's implementation weighs votes by stake and factors in Tower BFT lockout periods.
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.
GHOST (Greedy Heaviest Observed SubTree) (ghost) Categoria: Protocolo Base Definição: Greedy Heaviest Observed SubTree—a fork-choice rule where validators select the fork that has the most cumulative stake-weighted votes. Unlike longest-chain rules, GHOST considers all votes in the tree, not just the tip. Solana's implementation weighs votes by stake and factors in Tower BFT lockout periods. Aliases: GHOST Relacionados: Fork Choice, Tower BFT
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.
The algorithm validators use to decide which fork to build upon when multiple competing chains exist. Solana combines Tower BFT voting weight (stake-weighted votes with lockout) and a GHOST-like rule to select the fork with the heaviest cumulative stake support.
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).
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.
Entradas de glossário só ficam úteis quando estão conectadas. Esses links são o caminho mais curto para ideias adjacentes.
The algorithm validators use to decide which fork to build upon when multiple competing chains exist. Solana combines Tower BFT voting weight (stake-weighted votes with lockout) and a GHOST-like rule to select the fork with the heaviest cumulative stake support.
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).
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.