Security Limits of Mining Before Validation in Nakamoto Consensus
Paper quantifies how validation latency in Nakamoto consensus enables attacks that lure honest mining onto invalid branches.
The paper models Nakamoto consensus with bounded network delay and a validation-time bound, showing that mining before validation carries security risks missed when validation is treated as instantaneous. It proves an explicit threshold on adversarial mining power below which fully validated honest chains remain stable with high probability. The authors construct an attack that repeatedly draws honest mining onto invalid branches; when the adversary produces more than one block per validation period, target blocks can be removed at any confirmation depth. Combined with private mining, this yields a matching asymptotic bound in the fully decentralized regime.
- Proves adversarial power threshold below which honest validated chains stay stable
- Attack removes confirmed blocks at any depth if adversary mines over one block during validation
- Rejecting one invalid block also discards honest work built on it
- Validation latency constrains security beyond network-delay limits
From the original article
1 min read at arxiv.orgMining before validation allows miners to extend a newly received block before completing its validity checks, giving them a head start in the race for the next block reward. This head start, however, comes with a security risk: rejecting one invalid block also discards the honest work built on it, an effect missed when validation is treated as instantaneous.
By Yifan Zhou · arxiv.org
A short excerpt; the article and its images belong to the publisher. Summary, key facts and assessment above are AI-written from the article and can be wrong.