Improving Blockchain Consistency Bound by Assigning Weights to Random Blocks
Qing Zhang, Xueping Gong, Huizhong Li, Hao Wu, Jiheng Zhang

TL;DR
This paper introduces Ironclad, a method that assigns weights to randomly selected blocks in Nakamoto-based blockchains, significantly improving consistency bounds and enabling faster block production without compromising security.
Contribution
The paper presents a novel weighting scheme for blocks in Nakamoto consensus, enhancing consistency bounds and scalability.
Findings
Improved consistency bounds with weighted blocks
Faster block production under same security guarantees
Rigorous proof of enhanced consensus properties
Abstract
Blockchains based on the celebrated Nakamoto consensus protocol have shown promise in several applications, including cryptocurrencies. However, these blockchains have inherent scalability limits caused by the protocol's consensus properties. In particular, the \emph{consistency} property demonstrates a tight trade-off between block production speed and the system's security in terms of resisting adversarial attacks. This paper proposes a novel method, Ironclad, that improves blockchain consistency bound by assigning a different weight to randomly selected blocks. We apply our method to the original Nakamoto protocol and rigorously prove that such a combination can improve the consistency bound significantly by analyzing the fundamental consensus properties. Such an improvement enables a much faster block production rate than the original Nakamoto protocol under the same security…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBlockchain Technology Applications and Security · Cryptography and Data Security · Distributed systems and fault tolerance
