2000 character limit reached
Cordial Miners: Fast and Efficient Consensus for Every Eventuality
Published 18 May 2022 in cs.DC, cs.MA, and cs.NI | (2205.09174v6)
Abstract: Cordial Miners are a family of efficient Byzantine Atomic Broadcast protocols, with instances for asynchrony and eventual synchrony. They improve the latency of state-of-the-art DAG-based protocols by almost 2X and achieve optimal good-case complexity of O(n) by forgoing Reliable Broadcast as a building block. Rather, Cordial Miners use the blocklace -- a partially-ordered counterpart of the totally-ordered blockchain data structure -- to implement the three algorithmic components of consensus: Dissemination, equivocation-exclusion, and ordering.
- Asymptotically optimal validated asynchronous byzantine agreement. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, pages 337–346, 2019.
- Good-case latency of Byzantine broadcast: A complete categorization. In Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, pages 331–341, 2021.
- Distributed computing: fundamentals, simulations, and advanced topics, volume 19. John Wiley & Sons, 2004.
- Leemon Baird. The swirlds Hashgraph consensus algorithm: Fair, fast, Byzantine fault tolerance. Report, Swirlds, 2016.
- Asynchronous secure computation. In Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, pages 52–61, 1993.
- Short signatures from the weil pairing. In International conference on the theory and application of cryptology and information security, pages 514–532. Springer, 2001.
- Gabriel Bracha. Asynchronous Byzantine agreement protocols. Information and Computation, 75(2):130–143, 1987.
- Ethan Buchman. Tendermint: Byzantine fault tolerance in the age of blockchains. PhD thesis, University of Guelph, 2016.
- Secure and efficient asynchronous broadcast protocols. In Annual International Cryptology Conference, pages 524–541. Springer, 2001.
- Random oracles in Constantinople: Practical asynchronous byzantine agreement using cryptography. Journal of Cryptology, 18(3):219–246, 2005.
- Practical Byzantine fault tolerance. In Proceedings of the Third Symposium on Operating Systems Design and Implementation, page 173–186, New Orleans, Louisiana, USA, 1999. USENIX Association.
- An adaptive totally ordered multicast protocol that tolerates partitions. In Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing, pages 237–246, 1998.
- Blockmania: from block DAGs to consensus. arXiv preprint arXiv:1809.01620, 2018.
- Narwhal and tusk: a dag-based mempool and efficient bft consensus. In Proceedings of the Seventeenth European Conference on Computer Systems, pages 34–50, 2022.
- Asynchronous data dissemination and its applications. In Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, pages 2705–2721, 2021.
- Near-optimal balanced reliable broadcast and asynchronous verifiable information dispersal. Cryptology ePrint Archive, 2022.
- Some garbage in-some garbage out: Asynchronous t-byzantine as asynchronous benign t-resilient system with fixed t-trojan-horse inputs. arXiv preprint arXiv:1607.01210, 2016.
- Early delivery totally ordered multicast in asynchronous environments. In FTCS-23 The Twenty-Third International Symposium on Fault-Tolerant Computing, pages 544–553. IEEE, 1993.
- Bounds on information exchange for byzantine agreement. Journal of the ACM (JACM), 32(1):191–204, 1985.
- Aleph: A leaderless, asynchronous, byzantine fault tolerant consensus protocol. arXiv preprint arXiv:1810.05256, 2018.
- All you need is dag. In Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, pages 165–175, 2021.
- Cordial miners: A family of simple, efficient and self-contained consensus protocols for every eventuality. arXiv preprint arXiv:2205.09174, 2022.
- Born and raised distributively: Fully distributed non-interactive adaptively-secure threshold signatures with short shares. Theoretical Computer Science, 645:1–24, 2016.
- Hotstuff-2: Optimal two-phase responsive bft. Cryptology ePrint Archive, 2023.
- Serguei Popov. The tangle. https://assets.ctfassets.net/r1dr6vzfxhev/2t4uxvsIqk0EUau6g2sw0g/45eae33637ca92f85dd9f4a3a218e1ec/iota1_4_3.pdf, 2018.
- Scalable and probabilistic leaderless bft consensus through metastability. arXiv preprint arXiv:1906.08936, 2019.
- Embedding a deterministic BFT protocol in a block DAG. In Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, pages 177–186, 2021.
- Ehud Shapiro. Multiagent transition systems: Protocol-stack mathematics for distributed computing. arXiv preprint arXiv:2112.13650, 2021.
- Ehud Shapiro. Grassroots distributed systems: Concept, examples, implementation and applications. arXiv preprint arXiv:2301.04391, 2023.
- The Byzantine generals problem. ACM Transactions on Programming Languages and Systems, 4(3):382–401, 1982.
- Victor Shoup. Practical threshold signatures. In International Conference on the Theory and Applications of Cryptographic Techniques, pages 207–220. Springer, 2000.
- Secure high-rate transaction processing in Bitcoin. In International Conference on Financial Cryptography and Data Security, pages 507–527. Springer, 2015.
- Bullshark: Dag bft protocols made practical. In Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, pages 2705–2718, 2022.
- Hotstuff: Bft consensus with linearity and responsiveness. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, pages 347–356, 2019.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
