Examining Pre-Votes and Pre-Commits for the Byzantine Fault Tolerance Consensus (BFT) Mechanism

Written by nazarhussain | Published 2019/08/29
Tech Story Tags: blockchain | consensus-algorithm | dpos | cryptocurrency | delegated-proof-of-stake | byzantine-fault-tolerance | latest-tech-stories | lisk-architecture | web-monetization

TLDR Byzantine Fault Tolerance (BFT) is a new consensus algorithm for the Lisk protocol. BFT is designed to guarantee that a particular block is never reverted. It tries to recover from forks as quickly as possible to grow the network chain with better finality. Each node does not only maintain the blockchain, it also maintains additional metadata in memory to validate and verify blocks. This information will also be partially persisted on the blockchain itself, to make sure that a node can rebuild this in-memory dataset if it crashes.via the TL;DR App

no story

Written by nazarhussain | Programmer and technical designer. Currently work on Lisk, a blockhain application platform.
Published by HackerNoon on 2019/08/29