# Analysis of Nakamoto Consensus, Revisited

arXiv: https://arxiv.org/abs/1910.08510 · HTML: https://mlsanity.com/paper/1910.08510/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 18 Oct 2019.

## Built on by (most cited first, 1 of 1)

- [Byzantine-Resilient Learning Beyond Gradients: Distributing Evolutionary Search](https://mlsanity.com/paper/2304.13540/) (2023)

## Abstract (arXiv)

In the Bitcoin white paper, Nakamoto proposed a very simple Byzantine fault tolerant consensus algorithm that is also known as Nakamoto consensus. Despite its simplicity, some existing analysis of Nakamoto consensus appears to be long and involved. In this technical report, we aim to make such analysis simple and transparent so that we can teach senior undergraduate students and graduate students in our institutions. This report is largely based on a 3-hour tutorial given by one of the authors in June 2019.
