Bitcoin Security-Latency Under Network Delay

12/02/2022
by   Mustafa Doger, et al.
0

We improve security-latency bounds of Nakamoto consensus by analyzing the race between adversarial and honest chains in three different phases: pre-mining, confirmation and post-confirmation. We find the probability distribution of the length of the adversarial chain and the rigged adversarial chain under jumper models during the confirmation interval. We analyze certain properties of this race to model pre-mining and post-confirmation phases with random walks that provide tighter bounds than existing results. Combining all three phases provides novel upper and lower bounds for blockchains with small λΔ.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/12/2022

Bitcoin's Latency–Security Analysis Made Simple

Closed-form upper and lower bounds are developed for the security of the...
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
05/21/2020

Everything is a Race and Nakamoto Always Wins

Nakamoto invented the longest chain protocol, and claimed its security b...
research
02/01/2023

Is Stubborn Mining Severe in Imperfect GHOST Bitcoin-like Blockchains? Quantitative Analysis

GHOST, like the longest-chain protocol, is a chain selection protocol an...
research
02/01/2021

The Longest-Chain Protocol Under Random Delays

In the field of distributed consensus and blockchains, the synchronous c...
research
02/11/2022

Metastability of the Potts ferromagnet on random regular graphs

We study the performance of Markov chains for the q-state ferromagnetic ...
research
08/22/2021

The Power of Random Symmetry-Breaking in Nakamoto Consensus

Nakamoto consensus underlies the security of many of the world's largest...

Please sign up or login with your details

Forgot password? Click here to reset