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.
Empieza por la explicación más corta y útil antes de profundizar.
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.
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.
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.
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.
Usa este bloque compacto cuando quieras dar contexto sólido a un agente o asistente sin volcar toda la página.
Fork Choice (fork-choice) Categoría: Protocolo Base Definición: 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. Relacionados: Fork, Tower BFT, GHOST (Greedy Heaviest Observed SubTree)
Usa contexto del glosario, relaciones entre términos, modelos mentales y builder paths para recibir respuestas estructuradas en vez de output genérico.
Opcional: pega código Anchor, Solana o Rust para que el Copilot mapee primitivas de vuelta al glosario.
El Copilot responderá usando el término actual, conceptos relacionados, modelos mentales y el grafo alrededor del glosario.
Estas ramas muestran qué conceptos toca este término directamente y qué existe una capa más allá de ellos.
A divergence in the blockchain where two or more blocks are produced for the same slot or different validators build on different parent blocks. Forks are common during normal operation and are resolved by Tower BFT's fork-choice rule. Only one fork ultimately becomes the canonical chain; transactions on abandoned forks are dropped.
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).
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.
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.
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.
A divergence in the blockchain where two or more blocks are produced for the same slot or different validators build on different parent blocks. Forks are common during normal operation and are resolved by Tower BFT's fork-choice rule. Only one fork ultimately becomes the canonical chain; transactions on abandoned forks are dropped.
Las entradas del glosario se vuelven útiles cuando están conectadas. Estos enlaces son el camino más corto hacia ideas adyacentes.
A divergence in the blockchain where two or more blocks are produced for the same slot or different validators build on different parent blocks. Forks are common during normal operation and are resolved by Tower BFT's fork-choice rule. Only one fork ultimately becomes the canonical chain; transactions on abandoned forks are dropped.
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).
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.
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.
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.