Programação
PBFT
Também chamado de:Practical Byzantine Fault TolerancePBFT
📖O que é
Practical Byzantine Fault Tolerance. Classical BFT consensus algorithm (Castro & Liskov, 1999) tolerating up to f faulty nodes in 3f+1 total, requiring O(n^2) message complexity per round. Solana's Tower BFT reduces this to O(n) by using Proof of History as a clock, replacing round-based message exchanges with time-based vote lockouts.
Sua exploração
0 termos visitados no totalTermos relacionados explorados0/3
Termos Relacionados
Tower BFTCore Protocol
Solana's custom BFT consensus algorithm built on top of Proof of History. Tower BFT uses P…
Ver termo →Byzantine Fault Tolerance (BFT)Blockchain Geral
The ability of a distributed system to reach consensus despite some nodes behaving arbitra…
Ver termo →Mecanismo de ConsensoBlockchain Geral
The protocol by which nodes in a distributed network agree on the current state of the led…
Ver termo →