skip to main content
10.1145/3583668.3594567acmconferencesArticle/Chapter ViewAbstractPublication PagespodcConference Proceedingsconference-collections
research-article

On the Validity of Consensus

Published: 16 June 2023 Publication History

Abstract

The Byzantine consensus problem involves n processes, out of which t < n could be faulty and behave arbitrarily. Three properties characterize consensus: (1) termination, requiring correct (non-faulty) processes to eventually reach a decision, (2) agreement, preventing them from deciding different values, and (3) validity, precluding "unreasonable" decisions. But, what is a reasonable decision? Strong validity, a classical property, stipulates that, if all correct processes propose the same value, only that value can be decided. Weak validity, another established property, stipulates that, if all processes are correct and they propose the same value, that value must be decided. The space of possible validity properties is vast. Yet, their impact on consensus algorithms remains unclear.
This paper addresses the question of which validity properties allow Byzantine consensus to be solvable in a general partially synchronous model, and at what cost. First, we determine the necessary and sufficient conditions for a validity property to make the consensus problem solvable; we say that such validity properties are solvable. Notably, we prove that, if n ≤ 3t, all solvable validity properties are trivial (there exists an always-admissible decision). Furthermore, we show that, with any non-trivial (and solvable) validity property, consensus requires Ω(t2) messages. This extends the seminal Dolev-Reischuk bound, originally proven for strong validity, to all non-trivial validity properties. Lastly, we give a Byzantine consensus algorithm, we call Universal, for any solvable (and non-trivial) validity property. Importantly, Universal incurs O(n2) message complexity. Thus, together with our lower bound, Universal implies a fundamental result in partial synchrony: with t ∈ Ω(n), the message complexity of all (non-trivial) consensus variants is Θ(n2).

References

[1]
Michael Abd-El-Malek, Gregory R Ganger, Garth R Goodson, Michael K Reiter, and Jay J Wylie. 2005. Fault-Scalable Byzantine Fault-Tolerant Services. ACM SIGOPS Operating Systems Review 39, 5 (2005), 59--74.
[2]
Ittai Abraham, Yonatan Amit, and Danny Dolev. 2004. Optimal Resilience Asynchronous Approximate Agreement. In Principles of Distributed Systems, 8th International Conference, OPODIS 2004, Grenoble, France, December 15--17, 2004, Revised Selected Papers (Lecture Notes in Computer Science, Vol. 3544), Teruo Higashino (Ed.). Springer, 229--239.
[3]
Ittai Abraham and Cristian Cachin. [n. d.]. What about Validity? https://decentralizedthoughts.github.io/2022-12-12-what-about-validity/.
[4]
Ittai Abraham, T.-H. Hubert Chan, Danny Dolev, Kartik Nayak, Rafael Pass, Ling Ren, and Elaine Shi. 2019. Communication Complexity of Byzantine Agreement, Revisited. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC 2019, Toronto, ON, Canada, July 29 - August 2, 2019, Peter Robinson and Faith Ellen (Eds.). ACM, 317--326.
[5]
Ittai Abraham, Srinivas Devadas, Kartik Nayak, and Ling Ren. 2017. Brief Announcement: Practical Synchronous Byzantine Consensus. In 31st International Symposium on Distributed Computing (DISC 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.
[6]
Ittai Abraham, Dahlia Malkhi, Kartik Nayak, Ling Ren, and Alexander Spiegelman. 2016. Solida: A Blockchain Protocol Based on Reconfigurable Byzantine Consensus. arXiv preprint arXiv:1612.02916 (2016).
[7]
Ittai Abraham, Dahlia Malkhi, Kartik Nayak, Ling Ren, and Alexander Spiegelman. 2016. Solidus: An Incentive-compatible Cryptocurrency Based on Permissionless Byzantine Consensus. CoRR, abs/1612.02916 (2016).
[8]
Ittai Abraham, Dahlia Malkhi, and Alexander Spiegelman. 2019. Asymptotically Optimal Validated Asynchronous Byzantine Agreement. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing. 337--346.
[9]
Atul Adya, William Bolosky, Miguel Castro, Gerald Cermak, Ronnie Chaiken, John Douceur, Jon Howell, Jacob Lorch, Marvin Theimer, and Roger Wattenhofer. 2002. {FARSITE}: Federated, Available, and Reliable Storage for an Incompletely Trusted Environment. In 5th Symposium on Operating Systems Design and Implementation (OSDI 02).
[10]
Yair Amir, Claudiu Danilov, Jonathan Kirsch, John Lane, Danny Dolev, Cristina Nita-Rotaru, Josh Olsen, and David Zage. 2006. Scaling Byzantine Fault-Tolerant Replication to Wide Area Networks. In International Conference on Dependable Systems and Networks (DSN'06). IEEE, 105--114.
[11]
James Aspnes. 2003. Randomized Protocols for Asynchronous Consensus. Distributed Computing 16, 2 (2003), 165--175.
[12]
Michael Ben-Or. 1983. Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols (Extended Abstract). In Proceedings of the Second Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, Montreal, Quebec, Canada, August 17--19, 1983, Robert L. Probert, Nancy A. Lynch, and Nicola Santoro (Eds.). ACM, 27--30.
[13]
Michael Ben-Or and Ran El-Yaniv. 2003. Resilient-optimal interactive consistency in constant time. Distributed Computing 16, 4 (2003), 249--262.
[14]
Michael Ben-Or, Shafi Goldwasser, and Avi Wigderson. 2019. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation. In Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali. 351--371.
[15]
Michael Ben-Or, Boaz Kelmer, and Tal Rabin. 1994. Asynchronous Secure Computations with Optimal Resilience (Extended Abstract). In Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, Los Angeles, California, USA, August 14--17, 1994, James H. Anderson, David Peleg, and Elizabeth Borowsky (Eds.). ACM, 183--192.
[16]
Ofer Biran, Shlomo Moran, and Shmuel Zaks. 1990. A Combinatorial Characterization of the Distributed 1-Solvable Tasks. Journal of algorithms 11, 3 (1990), 420--440.
[17]
Zohir Bouzid, Damien Imbs, and Michel Raynal. 2016. A necessary condition for Byzantine k-set agreement. Inf. Process. Lett. 116, 12 (2016), 757--759.
[18]
Ethan Buchman. 2016. Tendermint: Byzantine Fault Tolerance in the Age of Blockchains. Ph. D. Dissertation. University of Guelph.
[19]
Ethan Buchman, Jae Kwon, and Zarko Milosevic. 2019. The latest gossip on BFT consensus. Technical Report 1807.04938. arXiv.
[20]
Christian Cachin, Rachid Guerraoui, and Luís Rodrigues. 2011. Introduction to Reliable and Secure Distributed Programming. Springer Science & Business Media.
[21]
Christian Cachin, Klaus Kursawe, Frank Petzold, and Victor Shoup. 2001. Secure and Efficient Asynchronous Broadcast Protocols. In Advances in Cryptology - CRYPTO 2001, 21st Annual International Cryptology Conference, Santa Barbara, California, USA, August 19--23, 2001, Proceedings (Lecture Notes in Computer Science, Vol. 2139), Joe Kilian (Ed.). Springer, 524--541.
[22]
Miguel Castro and Barbara Liskov. 2002. Practical Byzantine Fault Tolerance and Proactive Recovery. ACM Transactions on Computer Systems 20, 4 (2002).
[23]
Benny Chor and Lior Moscovici. 1989. Solvability in Asynchronous Environments (Extended Abstract). In 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October -- 1 November 1989. IEEE Computer Society, 422--427.
[24]
Pierre Civit, Muhammad Ayaz Dzulfikar, Seth Gilbert, Vincent Gramoli, Rachid Guerraoui, Jovan Komatovic, and Manuel Vidigueira. 2022. Byzantine Consensus is Θ(n2): The Dolev-Reischuk Bound is Tight even in Partial Synchrony!. In 36th International Symposium on Distributed Computing (DISC 2022) (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 246), Christian Scheideler (Ed.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 14:1--14:21.
[25]
Pierre Civit, Seth Gilbert, and Vincent Gramoli. 2021. Polygraph: Accountable Byzantine Agreement. In Proceedings of the 41st IEEE International Conference on Distributed Computing Systems (ICDCS'21).
[26]
Pierre Civit, Seth Gilbert, Vincent Gramoli, Rachid Guerraoui, Jovan Komatovic, Zarko Milosevic, and Adi Seredinschi. 2022. Crime and Punishment in Distributed Byzantine Decision Tasks. In 42nd IEEE International Conference on Distributed Computing Systems, ICDCS 2022, Bologna, Italy, July 10--13, 2022. IEEE, 34--44.
[27]
Pierre Civit, Seth Gilbert, Rachid Guerraoui, Jovan Komatovic, and Manuel Vidigueira. 2023. On the Validity of Consensus. CoRR abs/2301.04920 (2023). arXiv:2301.04920
[28]
Shir Cohen, Idit Keidar, and Oded Naor. 2021. Byzantine Agreement with Less Communication: Recent Advances. SIGACT News 52, 1 (2021), 71--80.
[29]
Miguel Correia. 2019. From Byzantine Consensus to Blockchain Consensus. In Essentials of Blockchain Technology. Chapman and Hall/CRC, 41--80.
[30]
Miguel Correia, Nuno Ferreira Neves, and Paulo Veríssimo. 2006. From Consensus to Atomic Broadcast: Time-Free Byzantine-Resistant Protocols without Signatures. Comput. J. 49, 1 (2006), 82--96.
[31]
Tyler Crain, Vincent Gramoli, Mikel Larrea, and Michel Raynal. 2018. DBFT: Efficient Leaderless Byzantine Consensus and its Applications to Blockchains. In Proceedings of the 17th IEEE International Symposium on Network Computing and Applications (NCA'18). IEEE.
[32]
Carole Delporte-Gallet, Hugues Fauconnier, Michel Raynal, and Mouna Safir. 2022. Optimal Algorithms for Synchronous Byzantine k-Set Agreement. In Stabilization, Safety, and Security of Distributed Systems - 24th International Symposium, SSS 2022, Clermont-Ferrand, France, November 15--17, 2022, Proceedings (Lecture Notes in Computer Science, Vol. 13751), Stéphane Devismes, Franck Petit, Karine Altisen, Giuseppe Antonio Di Luna, and Antonio Fernández Anta (Eds.). Springer, 178--192.
[33]
Carole Delporte-Gallet, Hugues Fauconnier, and Mouna Safir. 2020. Byzantine k-Set Agreement. In Networked Systems - 8th International Conference, NETYS 2020, Marrakech, Morocco, June 3--5, 2020, Proceedings (Lecture Notes in Computer Science, Vol. 12129), Chryssis Georgiou and Rupak Majumdar (Eds.). Springer, 183--191.
[34]
Danny Dolev and Rüdiger Reischuk. 1985. Bounds on Information Exchange for Byzantine Agreement. Journal of the ACM (JACM) 32, 1 (1985), 191--204.
[35]
Assia Doudou and André Schiper. 1998. Muteness Detectors for Consensus with Byzantine Processes. In Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, PODC '98, Puerto Vallarta, Mexico, June 28 -- July 2, 1998, Brian A. Coan and Yehuda Afek (Eds.). ACM, 315.
[36]
Sisi Duan, Xin Wang, and Haibin Zhang. 2023. Practical Signature-Free Asynchronous Common Subset in Constant Time. Cryptology ePrint Archive (2023).
[37]
C. Dwork, N. Lynch, and L. Stockmeyer. 1988. Consensus in the Presence of Partial Synchrony. Journal of the Association for Computing Machinery, Vol. 35, No. 2, pp.288--323 (1988).
[38]
Paul Ezhilchelvan, Achour Mostefaoui, and Michel Raynal. 2001. Randomized Multivalued Consensus. In Fourth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing. ISORC 2001. IEEE, 195--200.
[39]
Michael J Fischer and Nancy A Lynch. 1981. A Lower Bound for the Time to Assure Interactive Consistency. Technical Report. GEORGIA INST OF TECH ATLANTA SCHOOL OF INFORMATION AND COMPUTER SCIENCE.
[40]
Michael J Fischer, Nancy A Lynch, and Michael S Paterson. 1985. Impossibility of Distributed Consensus with One Faulty Process. Journal of the ACM (JACM) 32, 2 (1985), 374--382.
[41]
Matthias Fitzi and Juan A Garay. 2003. Efficient Player-Optimal Protocols for Strong and Differential Consensus. In Proceedings of the twenty-second annual symposium on Principles of distributed computing. 211--220.
[42]
Zvi Galil, Stuart Haber, and Moti Yung. 1987. Cryptographic Computation: Secure Fault-Tolerant Protocols and the Public-Key Model. In Conference on the Theory and Application of Cryptographic Techniques. Springer, 135--155.
[43]
Diana Ghinea, Chen-Da Liu-Zhang, and Roger Wattenhofer. 2022. Optimal Synchronous Approximate Agreement with Asynchronous Fallback. In PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 -- 29, 2022, Alessia Milani and Philipp Woelfel (Eds.). ACM, 70--80.
[44]
Diana Ghinea, Chen-Da Liu-Zhang, and Roger Wattenhofer. 2023. Multidimensional Approximate Agreement with Asynchronous Fallback. Cryptology ePrint Archive (2023).
[45]
Yossi Gilad, Rotem Hemo, Silvio Micali, Georgios Vlachos, and Nickolai Zeldovich. 2017. Algorand: Scaling Byzantine Agreements for Cryptocurrencies. In Proceedings of the 26th Symposium on Operating Systems Principles (Shanghai, China) (SOSP '17). Association for Computing Machinery, New York, NY, USA, 51--68.
[46]
Seth Gilbert, Nancy A Lynch, and Alexander A Shvartsman. 2010. Rambo: A Robust, Reconfigurable Atomic Memory Service for Dynamic Networks. Distributed Computing 23, 4 (2010), 225--272.
[47]
Rachid Guerraoui and André Schiper. 2001. The Generic Consensus Service. IEEE Trans. Software Eng. 27, 1 (2001), 29--41.
[48]
Attiya Hagit and Avidor Zvi. 2002. Wait-Free n-Set Consensus When Inputs Are Restricted. In International Symposium on Distributed Computing. Springer, 326--338.
[49]
Maurice Herlihy, Dmitry N. Kozlov, and Sergio Rajsbaum. 2013. Distributed Computing Through Combinatorial Topology. Morgan Kaufmann. https://store.elsevier.com/product.jsp?isbn=9780124045781
[50]
Maurice Herlihy and Nir Shavit. 1993. The Asynchronous Computability Theorem for t-Resilient Tasks. In Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, May 16--18, 1993, San Diego, CA, USA, S. Rao Kosaraju, David S. Johnson, and Alok Aggarwal (Eds.). ACM, 111--120.
[51]
Maurice Herlihy and Nir Shavit. 1999. The Topological Structure of Asynchronous Computability. J. ACM 46, 6 (1999), 858--923.
[52]
Kim P. Kihlstrom, Louise E. Moser, and Peter M. Melliar-Smith. 2003. Byzantine Fault Detectors for Solving Consensus. British Computer Society (2003).
[53]
Ramakrishna Kotla, Lorenzo Alvisi, Mike Dahlin, Allen Clement, and Edmund Wong. 2007. Zyzzyva: Speculative Byzantine Fault Tolerance. In Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles. 45--58.
[54]
Ramakrishna Kotla and Michael Dahlin. 2004. High Throughput Byzantine Fault Tolerance. In International Conference on Dependable Systems and Networks, 2004. IEEE, 575--584.
[55]
Dariusz R Kowalski and Achour Mostéfaoui. 2013. Synchronous Byzantine Agreement with Nearly a Cubic Number of Communication Bits. In Proceedings of the 2013 ACM symposium on Principles of distributed computing. 84--91.
[56]
Leslie Lamport. 2001. Paxos Made Simple. ACM SIGACT News (Distributed Computing Column) 32, 4 (Whole Number 121, December 2001) (2001), 51--58.
[57]
Leslie Lamport, Robert Shostak, and Marshall Pease. 1982. The Byzantine Generals Problem. ACM Transactions on Programming Languages and Systems 4, 3 (1982), 382--401.
[58]
Leslie Lamport, Robert Shostak, and Marshall Pease. 2019. The Byzantine Generals Problem. In Concurrency: the works of leslie lamport. 203--226.
[59]
Andrew Lewis-Pye. 2022. Quadratic worst-case message complexity for State Machine Replication in the partial synchrony model. arXiv preprint arXiv:2201.01107 (2022).
[60]
Yuan Lu, Zhenliang Lu, Qiang Tang, and Guiling Wang. 2020. Dumbo-MVBA: Optimal Multi-Valued Validated Asynchronous Byzantine Agreement, Revisited. In PODC '20: ACM Symposium on Principles of Distributed Computing, Virtual Event, Italy, August 3--7, 2020, Yuval Emek and Christian Cachin (Eds.). ACM, 129--138.
[61]
Loi Luu, Viswesh Narayanan, Kunal Baweja, Chaodong Zheng, Seth Gilbert, and Prateek Saxena. 2015. SCP: A Computationally-Scalable Byzantine Consensus Protocol For Blockchains. Cryptology ePrint Archive (2015).
[62]
Nancy A Lynch. 1996. Distributed Algorithms. Elsevier.
[63]
Dahlia Malkhi, Kartik Nayak, and Ling Ren. 2019. Flexible Byzantine Fault Tolerance. In Proceedings of the 2019 ACM SIGSAC conference on computer and communications security. 1041--1053.
[64]
Stathis Maneas, Nikos Chondros, Panos Diamantopoulos, Christos Patsonakis, and Mema Roussopoulos. 2021. On achieving interactive consistency in real-world distributed systems. J. Parallel and Distrib. Comput. 147 (2021), 220--235.
[65]
Darya Melnyk and Roger Wattenhofer. 2018. Byzantine Agreement with Interval Validity. In 2018 IEEE 37th Symposium on Reliable Distributed Systems (SRDS). IEEE, 251--260.
[66]
Hammurabi Mendes and Maurice Herlihy. 2013. Multidimensional Approximate Agreement in Byzantine Asynchronous Systems. In Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1--4, 2013, Dan Boneh, Tim Roughgarden, and Joan Feigenbaum (Eds.). ACM, 391--400.
[67]
Hammurabi Mendes, Christine Tasson, and Maurice Herlihy. 2014. Distributed Computability in Byzantine Asynchronous Systems. In Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31 -- June 03, 2014, David B. Shmoys (Ed.). ACM, 704--713.
[68]
Atsuki Momose and Ling Ren. 2021. Multi-Threshold Byzantine Fault Tolerance. In Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security. 1686--1699.
[69]
Atsuki Momose and Ling Ren. 2021. Optimal Communication Complexity of Authenticated Byzantine Agreement. In 35th International Symposium on Distributed Computing, DISC 2021, October 4--8, 2021, Freiburg, Germany (Virtual Conference) (LIPIcs, Vol. 209), Seth Gilbert (Ed.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 32:1--32:16.
[70]
Shlomo Moran and Yaron Wolfstahl. 1987. Extended Impossibility Results for Asynchronous Complete Networks. Inform. Process. Lett. 26, 3 (1987), 145--151.
[71]
Achour Mostefaoui, Sergio Rajsbaum, and Michel Raynal. 2003. Conditions on Input Vectors for Consensus Solvability in Asynchronous Distributed Systems. Journal of the ACM (JACM) 50, 6 (2003), 922--954.
[72]
Achour Mostefaoui, Sergio Rajsbaum, and Michel Raynal. 2003. Using Conditions to Expedite Consensus in Synchronous Distributed Systems. In International Symposium on Distributed Computing. Springer, 249--263.
[73]
Achour Mostefaoui, Sergio Rajsbaum, Michel Raynal, and Matthieu Roy. 2001. A Hierarchy of Conditions for Consensus Solvability. In Proceedings of the twentieth annual ACM symposium on Principles of distributed computing. 151--160.
[74]
Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal, and Matthieu Roy. 2002. Condition-Based Protocols for Set Agreement Problems. In International Symposium on Distributed Computing. Springer, 48--62.
[75]
Achour Mostefaoui, Michel Raynal, and Frédéric Tronel. 2000. From Binary Consensus to Multivalued Consensus in asynchronous message-passing systems. Inform. Process. Lett. 73, 5--6 (2000), 207--212.
[76]
Nuno Ferreira Neves, Miguel Correia, and Paulo Verissimo. 2005. Solving Vector Consensus with a Wormhole. IEEE Transactions on Parallel and Distributed Systems 16, 12 (2005), 1120--1131.
[77]
Marshall C. Pease, Robert E. Shostak, and Leslie Lamport. 1980. Reaching Agreement in the Presence of Faults. J. ACM 27, 2 (1980), 228--234.
[78]
Michel Raynal. 2002. Consensus in Synchronous Systems: A Concise Guided Tour. In 2002 Pacific Rim International Symposium on Dependable Computing, 2002. Proceedings. IEEE, 221--228.
[79]
Vikram Saraph, Maurice Herlihy, and Eli Gafni. 2018. An Algorithmic Approach to the Asynchronous Computability Theorem. J. Appl. Comput. Topol. 1, 3--4 (2018), 451--474.
[80]
Ulrich Schmid and Bettina Weiss. 2004. Synchronous Byzantine Agreement under Hybrid Process and Link Failures. (2004).
[81]
Victor Shoup. 2000. Practical Threshold Signatures. In Advances in Cryptology - EUROCRYPT 2000, International Conference on the Theory and Application of Cryptographic Techniques, Bruges, Belgium, May 14--18, 2000, Proceeding (Lecture Notes in Computer Science, Vol. 1807), Bart Preneel (Ed.). Springer, 207--220.
[82]
Hin-Sing Siu, Yeh-Hao Chin, and Wei-Pang Yang. 1998. Reaching strong consensus in the presence of mixed failure types. Information Sciences 108, 1-4 (1998), 157--180.
[83]
David Stolz and Roger Wattenhofer. 2016. Byzantine Agreement with Median Validity. In 19th International Conference on Principles of Distributed Systems (OPODIS 2015), Vol. 46. Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 22.
[84]
Gadi Taubenfeld, Shmuel Katz, and Shlomo Moran. 1989. Initial Failures in Distributed Computations. International Journal of Parallel Programming 18, 4 (1989), 255--276.
[85]
Nitin H Vaidya and Vijay K Garg. 2013. Byzantine Vector Consensus in Complete Graphs. In Proceedings of the 2013 ACM symposium on Principles of distributed computing. 65--73.
[86]
Giuliana Santos Veronese, Miguel Correia, Alysson Neves Bessani, Lau Cheuk Lung, and Paulo Verissimo. 2011. Efficient Byzantine Fault-Tolerance. IEEE Trans. Comput. 62, 1 (2011), 16--30.
[87]
Maofan Yin, Dahlia Malkhi, Michael K Reiter, Guy Golan Gueta, and Ittai Abraham. 2019. HotStuff: BFT Consensus with Linearity and Responsiveness. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing. 347--356.
[88]
Yoav Zibin. 2003. Condition-Based Consensus in Synchronous Systems. In International Symposium on Distributed Computing. Springer, 239--248.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
PODC '23: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing
June 2023
392 pages
ISBN:9798400701214
DOI:10.1145/3583668
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 16 June 2023

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. byzantine consensus
  2. solvability
  3. message complexity
  4. lower bound

Qualifiers

  • Research-article

Conference

PODC '23
Sponsor:

Acceptance Rates

PODC '23 Paper Acceptance Rate 29 of 110 submissions, 26%;
Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)108
  • Downloads (Last 6 weeks)9
Reflects downloads up to 20 Feb 2025

Other Metrics

Citations

Cited By

View all

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media