Analysis of the Blockchain Protocol in （分析区块链协议的）.pdf

1 2 ) n o i t c a r 3 f 10 y r a s r e v d A ( ρ 1 10 1 2 4 10 25 60 100 c (blocktime in terms of network delay ∆) Figure 1: For n = 105 and ∆ = 1013 (i.e., 10s delays at 1TH/s for commercially avail- able mining hardware—these parameters roughly coincide with estimates of hashrate as of February 2016), we set hardness parameter p = 1 where c varies along the x-axis. We c·n∆ can interpret c as the expected blocktime in terms of the network delay ∆. The blue graph depicts a numerically-computed maximum value of ρ for which α(1 − (2∆ + 2)α) β, i.e. parameters under which our theorem shows consistency of the Nakamoto protocol. The gray plot shows our consistency theorem if Nakamoto adopted a deterministic tie-breaking rule. The red plot shows when our best attack succeeds in violating consistency. When c = 60, the hardness roughly corresponds to an expected 10-minute blocktime, and our theorem