Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
153 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Optimal Multilevel Slashing for Blockchains (2405.08135v2)

Published 13 May 2024 in cs.DC, cs.DM, and math.PR

Abstract: We present the notion of multilevel slashing, where proof-of-stake blockchain validators can obtain gradual levels of assurance that a certain block is bound to be finalized in a global consensus procedure, unless an increasing and optimally large number of Byzantine processes have their staked assets slashed -- that is, deducted -- due to provably incorrect behavior. Our construction is a highly parameterized generalization of combinatorial intersection systems based on finite projective spaces, with asymptotic high availability and optimal slashing properties. Even under weak conditions, we show that our construction has asymptotically optimal slashing properties with respect to message complexity and validator load; this result also illustrates a fundamental trade off between message complexity, load, and slashing. In addition, we show that any intersection system whose ground elements are disjoint subsets of nodes (e.g. "committees" in committee-based consensus protocols) has asymptotic high availability under similarly weak conditions. Finally, our multilevel construction gives the flexibility to blockchain validators to decide how many "levels" of finalization assurance they wish to obtain. This functionality can be seen either as (i) a form of an early, slashing-based block finalization; or (ii) a service to support reorg tolerance.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (31)
  1. A. El Abbadi and S. Toueg. Maintaining availability in partitioned replicated databases. ACM Trans. Database Syst., 14(2):264–290, jun 1989.
  2. G. Bracha. Asynchronous Byzantine agreement protocols. Information and Computation, 75(2):130–143, November 1987.
  3. Casper the friendly finality gadget. CoRR, abs/1710.09437, 2017.
  4. Introduction to Reliable and Secure Distributed Programming. Springer, 2 edition, February 2011.
  5. Quorum Systems in Permissionless Networks. In Eshcar Hillel, Roberto Palmieri, and Etienne Rivière, editors, 26th International Conference on Principles of Distributed Systems (OPODIS 2022), volume 253 of Leibniz International Proceedings in Informatics (LIPIcs), pages 17:1–17:22, Dagstuhl, Germany, 2023. Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
  6. Practical byzantine fault tolerance. In Proceedings of the Third Symposium on Operating Systems Design and Implementation, OSDI ’99, page 173–186, USA, 1999. USENIX Association.
  7. David C Clark. Applications of finite geometries to designs and codes. Michigan Technological University, 2012.
  8. Charles J Colbourn. CRC handbook of combinatorial designs. CRC press, 2010.
  9. Quorum systems constructed from combinatorial designs. Information and Computation, 169(2):160–173, 2001.
  10. Plonk: Permutations over lagrange-bases for oecumenical noninteractive arguments of knowledge. Cryptology ePrint Archive, Paper 2019/953, 2019. https://eprint.iacr.org/2019/953.
  11. Federated Byzantine Quorum Systems. In Jiannong Cao, Faith Ellen, Luis Rodrigues, and Bernardo Ferreira, editors, 22nd International Conference on Principles of Distributed Systems (OPODIS 2018), volume 125 of Leibniz International Proceedings in Informatics (LIPIcs), pages 17:1–17:16, Dagstuhl, Germany, 2019. Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
  12. Maurice Herlihy. A quorum-consensus replication method for abstract data types. ACM Trans. Comput. Syst., 4(1):32–53, feb 1986.
  13. Maurice Herlihy. Dynamic quorum adjustment for partitioned data. ACM Trans. Database Syst., 12(2):170–194, jun 1987.
  14. A high availability N𝑁\sqrt{N}square-root start_ARG italic_N end_ARG hierarchical grid algorithm for replicated data. Information Processing Letters, 40(6):311–316, 1991.
  15. Geoquorum: Load balancing and energy efficient data access in wireless sensor networks. In 2011 Proceedings IEEE INFOCOM, pages 616–620. IEEE, 2011.
  16. Mamoru Maekawa. A N𝑁\sqrt{N}square-root start_ARG italic_N end_ARG algorithm for mutual exclusion in decentralized systems. ACM Transactions on Computer Systems (TOCS), 3(2):145–159, 1985.
  17. Probabilistic quorum systems. In Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, PODC ’97, page 267–273, New York, NY, USA, 1997. Association for Computing Machinery.
  18. David Mazières. The stellar consensus protocol: A federated model for internet-level consensus. Technical report, StellarDevelopmentFoundation, 2016.
  19. M. Naor and A. Wool. The load, capacity and availability of quorum systems. In Proceedings 35th Annual Symposium on Foundations of Computer Science, pages 214–225, 1994.
  20. Scalable and dynamic quorum systems. Distributed Computing, 17(4):311–322, 2005.
  21. Ebb-and-flow protocols: A resolution of the availability-finality dilemma. In 2021 IEEE Symposium on Security and Privacy (SP), pages 446–465, 2021.
  22. Two more attacks on proof-of-stake ghost/ethereum. In Proceedings of the 2022 ACM Workshop on Developments in Consensus, pages 43–52, 2022.
  23. The availability of quorum systems. Information and Computation, 123(2):210–223, 1995.
  24. A fault-tolerant algorithm for replicated data management. IEEE Transactions on parallel and distributed systems, 6(12):1271–1282, 1995.
  25. Double rulings for information brokerage in sensor networks. In Proceedings of the 12th annual international conference on mobile computing and networking, pages 286–297, 2006.
  26. Fred B. Schneider. Implementing fault-tolerant services using the state machine approach: a tutorial. ACM Comput. Surv., 22(4):299–319, dec 1990.
  27. Three attacks on proof-of-stake ethereum. In International Conference on Financial Cryptography and Data Security, pages 560–576. Springer, 2022.
  28. T. Srikanth and S. Toueg. Simulating authenticated broadcasts to derive simple fault-tolerant algorithms. Distributed Computing, 2(2):80–94, June 1987.
  29. GRANDPA: a byzantine finality gadget. CoRR, abs/2007.01560, 2020.
  30. Gossipsub: Attack-resilient message propagation in the filecoin and eth2.0 networks, 2020.
  31. Hotstuff: Bft consensus with linearity and responsiveness. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC ’19, page 347–356, New York, NY, USA, 2019. Association for Computing Machinery.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now