The Zcash ArboretumI–IX The Complete Arboretum
Contents
PDF
Theme

Part IV Consensus Guide: Nakamoto consensus: the double-spend race, the arithmetic of confirmations, and the deployed most-work rule

This volume of The Zcash Arboretum constructs Nakamoto consensus and quantifies its security. It assumes the probability foundations of the Math Guide and the hash and commitment foundations of the Crypto Guide. It states the block tree and the most-work rule as the protocol specification defines them and as the deployed zebra implements them; constructs the race-specific probability that the analysis needs (memoryless clocks, the biased random walk, the negative binomial law); develops the exact first-seen-model double-spending analysis of Rosenfeld’s Analysis of hashrate-based double-spending (the catch-up theorem, the confirmation formula, and the economics of the attack), with every derived number recomputed by script and the results instantiated for Zcash’s proposed 25-second blocks; describes the draft NU7 transition to 25-second blocks, fee removal, and halving-preserving reissuance; and describes the protocol and implementation safeguards (difficulty adjustment, reorg windows, coinbase maturity, wallet confirmation policy) and their relation to the model’s assumptions. Where the specification, the paper, and the deployed nodes disagree, the divergence is stated.