How can a group of mutually distrustful nodes agree on the same ledger?
The “Byzantine Generals Problem” was systematically described by Lamport, Shostak, and Pease in a 1982 paper, which explored how to reach consensus in the presence of traitors.
Bitcoin’s proof of work uses a computational power competition to determine who creates the next block, keeping the ledger consistent as long as honest nodes control the majority of the computing power.
When managing funds, the most important thing to consider is this: when assessing a chain’s security, pay attention to how many validators there are and whether voting power is overly concentrated in the hands of a few nodes.
$ATOM 1.843 (+1.21%)
#ATOM
The “Byzantine Generals Problem” was systematically described by Lamport, Shostak, and Pease in a 1982 paper, which explored how to reach consensus in the presence of traitors.
Bitcoin’s proof of work uses a computational power competition to determine who creates the next block, keeping the ledger consistent as long as honest nodes control the majority of the computing power.
When managing funds, the most important thing to consider is this: when assessing a chain’s security, pay attention to how many validators there are and whether voting power is overly concentrated in the hands of a few nodes.
$ATOM 1.843 (+1.21%)
#ATOM