The goal of a distributed consensus algorithmA distributed hash table is akin to a dictionary service within a distributed network. Every node in the network is identified by a randomly chosen ID. Every value stored on the network is identified by a randomly distributed key. Every node has partial knowledge of the network by maintaining a ... More is to allow a set of computers to all agree on a single value that one of the nodes in the system proposed (as opposed to making up a random value).

Back to glossary