Communication cost of consensus for nodes with limited memory
arXiv: Distributed, Parallel, and Cluster Computing, Volume abs/1901.01665, 2019.
Motivated by applications in blockchains and sensor networks, we consider a model of $n$ nodes trying to reach consensus on their majority bit. Each node $i$ is assigned a bit at time zero, and is a finite automaton with $m$ bits of memory (i.e., $2^m$ states) and a Poisson clock. When the clock of $i$ rings, $i$ can choose to communicate...More
PPT (Upload PPT)