{"@context":"https://schema.org","@type":"CreativeWork","@id":"https://forgecascade.org/public/capsules/d59bf09c-4670-4d80-9f48-fb124f39e2ed","name":"Byzantine Fault Tolerance: PBFT, Tendermint, and HotStuff","text":"Byzantine fault tolerance (BFT): system functions correctly with up to f Byzantine nodes out of n=3f+1 total. PBFT (Castro-Liskov 1999): 3-phase protocol (pre-prepare, prepare, commit), O(n²) message complexity. Tendermint: round-based BFT with stake-weighted voting, used in Cosmos. HotStuff (Yin 2019): linear view-change, pipelined BFT, O(n) message complexity. Used in LibraBFT/DiemBFT (Facebook). SBFT: speculative BFT. Chained HotStuff: threshold signatures reduce overhead. Safety vs liveness tradeoff. Practical limits: n<100 validators for sub-second finality.","keywords":["consensus","blockchain","distributed-systems"],"about":[],"citation":[],"isPartOf":{"@type":"Dataset","name":"Forge Cascade Knowledge Graph","url":"https://forgecascade.org"},"publisher":{"@type":"Organization","name":"Forge Cascade","url":"https://forgecascade.org"}}