Connecting the Dots: FLP, BFT & Consensus Algorithmsby@11janci
1,065 reads

Connecting the Dots: FLP, BFT & Consensus Algorithms

tldt arrow
Read on Terminal Reader
Read this story w/o Javascript

Too Long; Didn't Read

This miniseries is an attempt to strike that balance of detail for beginner to intermediate readers who know the What and are trying to understand the Why and How. To design an algorithm that is fault tolerant, we must first understand what exactly a node failure is and how it manifests in terms of the node’s behavior. Byzantine failures are hardest to deal with because the behavior is non-deterministic and the node might appear as healthy to the rest of the network. In a synchronous model, there is a known upper bound on the delay for transmitting and processing a message, while an asynchronous model is not guaranteed to finish within a known time.

Coin Mentioned

Mention Thumbnail
featured image - Connecting the Dots: FLP, BFT & Consensus Algorithms
Jan Janik HackerNoon profile picture

@11janci

Jan Janik


Receive Stories from @11janci

react to story with heart
Jan Janik HackerNoon profile picture
by Jan Janik @11janci.The Edge... The only people who really know where it is are the ones who have gone over.
Read My Stories

RELATED STORIES

L O A D I N G
. . . comments & more!
Hackernoon hq - po box 2206, edwards, colorado 81632, usa