Bitcoin's Latency–Security Analysis Made Simple

03/12/2022
by   Dongning Guo, et al.
0

Closed-form upper and lower bounds are developed for the security of the Nakamoto consensus as a function of the confirmation depth. The bounds are easy to compute using only geometric and binomial distributions. The gap between the upper and lower bounds is small for Bitcoin's parameters.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/28/2020

Close Latency–Security Trade-off for the Nakamoto Consensus

Bitcoin is a peer-to-peer electronic cash system invented by Nakamoto in...
research
12/02/2022

Bitcoin Security-Latency Under Network Delay

We improve security-latency bounds of Nakamoto consensus by analyzing th...
research
02/07/2020

Bounds on the Information Divergence for Hypergeometric Distributions

The hypergeometric distributions have many important applications, but t...
research
09/21/2019

Automated Lower Bounds on the I/O Complexity of Computation Graphs

We consider the problem of finding lower bounds on the I/O complexity of...
research
05/29/2021

Towards a Rigorous Statistical Analysis of Empirical Password Datasets

In this paper we consider the following problem: given N independent sam...
research
03/02/2020

The mathematics of Bitcoin

We survey recent results on the mathematical stability of Bitcoin protoc...

Please sign up or login with your details

Forgot password? Click here to reset