Examining Pre-Votes and Pre-Commits for the Byzantine Fault Tolerance Consensus (BFT) Mechanismby@nazarhussain
215 reads

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

by Nazar Hussain7mAugust 29th, 2019
Read on Terminal Reader
Read this story w/o Javascript
tldt arrow

Too Long; Didn't Read

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.

Companies Mentioned

Mention Thumbnail
Mention Thumbnail

Coins Mentioned

Mention Thumbnail
Mention Thumbnail
featured image - Examining Pre-Votes and Pre-Commits for the Byzantine Fault Tolerance Consensus (BFT) Mechanism
Nazar Hussain HackerNoon profile picture
Nazar Hussain

Nazar Hussain

@nazarhussain

Programmer and technical designer. Currently work on Lisk, a blockhain application platform.

Learn More
LEARN MORE ABOUT @NAZARHUSSAIN'S
EXPERTISE AND PLACE ON THE INTERNET.

Share Your Thoughts

About Author

Nazar Hussain HackerNoon profile picture
Nazar Hussain@nazarhussain
Programmer and technical designer. Currently work on Lisk, a blockhain application platform.

TOPICS

THIS ARTICLE WAS FEATURED IN...

Permanent on Arweave
Read on Terminal Reader
Read this story in a terminal
 Terminal
Read this story w/o Javascript
Read this story w/o Javascript
 Lite
Also published here
L O A D I N G
. . . comments & more!