TY - GEN
T1 - Optimal bootstrapping of PoW blockchains
AU - Rana, Ranvir
AU - Karakostas, Dimitris
AU - Kannan, Sreeram
AU - Kiayias, Aggelos
AU - Viswanath, Pramod
N1 - Publisher Copyright:
© 2022 ACM.
PY - 2022/10/3
Y1 - 2022/10/3
N2 - Proof of Work (PoW) blockchains are susceptible to adversarial majority mining attacks in the early stages due to incipient participation and corresponding low net hash power. Bootstrapping ensures safety and liveness during the transient stage by protecting against a majority mining attack, allowing a PoW chain to grow the participation base and corresponding mining hash power. Liveness is especially important since a loss of liveness will lead to loss of honest mining rewards, decreasing honest participation, hence creating an undesired spiral; indeed existing bootstrapping mechanisms offer especially weak liveness guarantees. In this paper, we propose Advocate, a new bootstrapping methodology, which achieves two main results: (a) optimal liveness and low latency under a super-majority adversary for the Nakamoto longest chain protocol and (b) immediate black-box generalization to a variety of parallel-chain based scaling architectures, including OHIE [34] and Prism [4]. We demonstrate via a full-stack implementation the robustness of Advocate under a 90% adversarial majority.
AB - Proof of Work (PoW) blockchains are susceptible to adversarial majority mining attacks in the early stages due to incipient participation and corresponding low net hash power. Bootstrapping ensures safety and liveness during the transient stage by protecting against a majority mining attack, allowing a PoW chain to grow the participation base and corresponding mining hash power. Liveness is especially important since a loss of liveness will lead to loss of honest mining rewards, decreasing honest participation, hence creating an undesired spiral; indeed existing bootstrapping mechanisms offer especially weak liveness guarantees. In this paper, we propose Advocate, a new bootstrapping methodology, which achieves two main results: (a) optimal liveness and low latency under a super-majority adversary for the Nakamoto longest chain protocol and (b) immediate black-box generalization to a variety of parallel-chain based scaling architectures, including OHIE [34] and Prism [4]. We demonstrate via a full-stack implementation the robustness of Advocate under a 90% adversarial majority.
UR - http://www.scopus.com/inward/record.url?scp=85139709760&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85139709760&partnerID=8YFLogxK
U2 - 10.1145/3492866.3549731
DO - 10.1145/3492866.3549731
M3 - Conference contribution
AN - SCOPUS:85139709760
T3 - Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)
SP - 231
EP - 240
BT - MobiHoc 2022 - Proceedings of the 2022 23rd International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing
PB - Association for Computing Machinery
T2 - 23rd ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2022
Y2 - 17 October 2022 through 20 October 2022
ER -