{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:47:17Z","timestamp":1750308437847,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,6,19]],"date-time":"2023-06-19T00:00:00Z","timestamp":1687132800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-sa\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,6,19]]},"DOI":"10.1145\/3584684.3597268","type":"proceedings-article","created":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T15:01:25Z","timestamp":1687273285000},"page":"1-8","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Invited Paper: Lessons from HotStuff"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7038-7250","authenticated-orcid":false,"given":"Dahlia","family":"Malkhi","sequence":"first","affiliation":[{"name":"Chainlink Labs, San Francisco, United States of America"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-2717-8150","authenticated-orcid":false,"given":"Maofan","family":"Yin","sequence":"additional","affiliation":[{"name":"Chainlink Labs, San Francisco, USA"},{"name":"Ava Labs, Inc., New York, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,6,20]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Ittai Abraham Guy Gueta Dahlia Malkhi Lorenzo Alvisi Rama Kotla and Jean-Philippe Martin. 2017. Revisiting Fast Practical Byzantine Fault Tolerance. arXiv:cs.DC\/1712.01367  Ittai Abraham Guy Gueta Dahlia Malkhi Lorenzo Alvisi Rama Kotla and Jean-Philippe Martin. 2017. Revisiting Fast Practical Byzantine Fault Tolerance. arXiv:cs.DC\/1712.01367"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331612"},{"key":"e_1_3_2_1_3_1","volume-title":"Malicious security comes for free in consensus with leaders. Cryptology ePrint Archive","author":"Abspoel Mark","year":"2020","unstructured":"Mark Abspoel , Thomas Attema , and Matthieu Rambaud . 2020. Malicious security comes for free in consensus with leaders. Cryptology ePrint Archive ( 2020 ). Mark Abspoel, Thomas Attema, and Matthieu Rambaud. 2020. Malicious security comes for free in consensus with leaders. Cryptology ePrint Archive (2020)."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(99)00100-3"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(87)90054-X"},{"key":"e_1_3_2_1_6_1","unstructured":"Ethan Buchman. 2016. Tendermint: Byzantine fault tolerance in the age of blockchains. Ph.D. Dissertation. University of Guelph.  Ethan Buchman. 2016. Tendermint: Byzantine fault tolerance in the age of blockchains. Ph.D. Dissertation. University of Guelph."},{"key":"e_1_3_2_1_7_1","volume-title":"Casper the Friendly Finality Gadget. arXiv preprint arXiv:1710.09437","author":"Buterin Vitalik","year":"2017","unstructured":"Vitalik Buterin and Virgil Griffith . 2017. Casper the Friendly Finality Gadget. arXiv preprint arXiv:1710.09437 ( 2017 ). Vitalik Buterin and Virgil Griffith. 2017. Casper the Friendly Finality Gadget. arXiv preprint arXiv:1710.09437 (2017)."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Christian Cachin Klaus Kursawe Frank Petzold and Victor Shoup. 2001. Secure and Efficient Asynchronous Broadcast Protocols. IACR Cryptol. ePrint Arch. (2001) 6. http:\/\/eprint.iacr.org\/2001\/006  Christian Cachin Klaus Kursawe Frank Petzold and Victor Shoup. 2001. Secure and Efficient Asynchronous Broadcast Protocols. IACR Cryptol. ePrint Arch. (2001) 6. http:\/\/eprint.iacr.org\/2001\/006","DOI":"10.1007\/3-540-44647-8_31"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/296806.296824"},{"key":"e_1_3_2_1_10_1","volume-title":"International Symposium on Distributed Computing.","author":"Civit Pierre","year":"2022","unstructured":"Pierre Civit , Muhammad Ayaz Dzulfikar , Seth Gilbert , Vincent Gramoli , Rachid Guerraoui , Jovan Komatovic , and Manuel Vidigueira . 2022 . Byzantine Consensus Is \u0398(n2): The Dolev-Reischuk Bound Is Tight Even in Partial Synchrony! . In International Symposium on Distributed Computing. Pierre Civit, Muhammad Ayaz Dzulfikar, Seth Gilbert, Vincent Gramoli, Rachid Guerraoui, Jovan Komatovic, and Manuel Vidigueira. 2022. Byzantine Consensus Is \u0398(n2): The Dolev-Reischuk Bound Is Tight Even in Partial Synchrony!. In International Symposium on Distributed Computing."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1558977.1558988"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3492321.3519594"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2455.214112"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/277697.277724"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-18283-9_14"},{"key":"e_1_3_2_1_16_1","volume-title":"No-commit proofs: Defeating livelock in BFT. Cryptology ePrint Archive","author":"Giridharan Neil","year":"2021","unstructured":"Neil Giridharan , Heidi Howard , Ittai Abraham , Natacha Crooks , and Alin Tomescu . 2021. No-commit proofs: Defeating livelock in BFT. Cryptology ePrint Archive ( 2021 ). Neil Giridharan, Heidi Howard, Ittai Abraham, Natacha Crooks, and Alin Tomescu. 2021. No-commit proofs: Defeating livelock in BFT. Cryptology ePrint Archive (2021)."},{"key":"e_1_3_2_1_17_1","volume-title":"Orr Tamir, and Alin Tomescu.","author":"Gueta Guy Golan","year":"2019","unstructured":"Guy Golan Gueta , Ittai Abraham , Shelly Grossman , Dahlia Malkhi , Benny Pinkas , Michael Reiter , Dragos Adrian Seredinschi , Orr Tamir, and Alin Tomescu. 2019 . SBFT : A Scalable and Decentralized Trust Infrastructure. In Proceedings - 49th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks, DSN 2019 (Proceedings - 49th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks, DSN 2019). 568--580. Guy Golan Gueta, Ittai Abraham, Shelly Grossman, Dahlia Malkhi, Benny Pinkas, Michael Reiter, Dragos Adrian Seredinschi, Orr Tamir, and Alin Tomescu. 2019. SBFT: A Scalable and Decentralized Trust Infrastructure. In Proceedings - 49th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks, DSN 2019 (Proceedings - 49th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks, DSN 2019). 568--580."},{"key":"e_1_3_2_1_18_1","volume-title":"Fast-HotStuff: A fast and resilient HotStuff protocol. arXiv preprint arXiv:2010.11454","author":"Jalalzai Mohammad M","year":"2020","unstructured":"Mohammad M Jalalzai , Jianyu Niu , Chen Feng , and Fangyu Gai . 2020. Fast-HotStuff: A fast and resilient HotStuff protocol. arXiv preprint arXiv:2010.11454 ( 2020 ). Mohammad M Jalalzai, Jianyu Niu, Chen Feng, and Fangyu Gai. 2020. Fast-HotStuff: A fast and resilient HotStuff protocol. arXiv preprint arXiv:2010.11454 (2020)."},{"key":"e_1_3_2_1_19_1","unstructured":"Dakai Kang Sajjad Rahnama Jelle Hellings and Mohammad Sadoghi. 2023. Practical View-Change-Less Protocol through Rapid View Synchronization. arXiv:cs.DB\/2302.02118  Dakai Kang Sajjad Rahnama Jelle Hellings and Mohammad Sadoghi. 2023. Practical View-Change-Less Protocol through Rapid View Synchronization. arXiv:cs.DB\/2302.02118"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2008.08.001"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1294261.1294267"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Klaus Kursawe and Victor Shoup. 2005. Optimistic Asynchronous Atomic Broadcast. In Automata Languages and Programming. 204--215.  Klaus Kursawe and Victor Shoup. 2005. Optimistic Asynchronous Atomic Broadcast. In Automata Languages and Programming. 204--215.","DOI":"10.1007\/11523468_17"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"},{"key":"e_1_3_2_1_24_1","volume-title":"FairLedger: A Fair Blockchain Protocol for Financial Institutions. In International Conference on Principles of Distributed Systems.","author":"Lev-Ari Kfir","year":"2019","unstructured":"Kfir Lev-Ari , Alexander Spiegelman , Idit Keidar , and Dahlia Malkhi . 2019 . FairLedger: A Fair Blockchain Protocol for Financial Institutions. In International Conference on Principles of Distributed Systems. Kfir Lev-Ari, Alexander Spiegelman, Idit Keidar, and Dahlia Malkhi. 2019. FairLedger: A Fair Blockchain Protocol for Financial Institutions. In International Conference on Principles of Distributed Systems."},{"key":"e_1_3_2_1_25_1","volume-title":"Quadratic worst-case message complexity for State Machine Replication in the partial synchrony model. ArXiv abs\/2201.01107","author":"Lewis-Pye Andrew","year":"2022","unstructured":"Andrew Lewis-Pye . 2022. Quadratic worst-case message complexity for State Machine Replication in the partial synchrony model. ArXiv abs\/2201.01107 ( 2022 ). Andrew Lewis-Pye. 2022. Quadratic worst-case message complexity for State Machine Replication in the partial synchrony model. ArXiv abs\/2201.01107 (2022)."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3559346"},{"key":"e_1_3_2_1_27_1","volume-title":"The Latest View on View Synchronization. https:\/\/blog.chain.link\/view-synchronization\/","author":"Malkhi Dahlia","year":"2022","unstructured":"Dahlia Malkhi and Oded Naor . 2022. The Latest View on View Synchronization. https:\/\/blog.chain.link\/view-synchronization\/ ( 2022 ). Dahlia Malkhi and Oded Naor. 2022. The Latest View on View Synchronization. https:\/\/blog.chain.link\/view-synchronization\/ (2022)."},{"key":"e_1_3_2_1_28_1","volume-title":"Extended Abstract: HotStuff-2: Optimal Two-Phase Responsive BFT. Cryptology ePrint Archive, Paper 2023\/397. https:\/\/eprint.iacr.org\/2023\/397 https:\/\/eprint.iacr.org\/2023\/397.","author":"Malkhi Dahlia","year":"2023","unstructured":"Dahlia Malkhi and Kartik Nayak . 2023 . Extended Abstract: HotStuff-2: Optimal Two-Phase Responsive BFT. Cryptology ePrint Archive, Paper 2023\/397. https:\/\/eprint.iacr.org\/2023\/397 https:\/\/eprint.iacr.org\/2023\/397. Dahlia Malkhi and Kartik Nayak. 2023. Extended Abstract: HotStuff-2: Optimal Two-Phase Responsive BFT. Cryptology ePrint Archive, Paper 2023\/397. https:\/\/eprint.iacr.org\/2023\/397 https:\/\/eprint.iacr.org\/2023\/397."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2006.35"},{"key":"e_1_3_2_1_30_1","volume-title":"The Saddest Moment. login Usenix Mag. 39, 3","author":"Mickens James","year":"2014","unstructured":"James Mickens . 2014. The Saddest Moment. login Usenix Mag. 39, 3 ( 2014 ). https:\/\/www.usenix.org\/publications\/login\/june14\/mickens James Mickens. 2014. The Saddest Moment. login Usenix Mag. 39, 3 (2014). https:\/\/www.usenix.org\/publications\/login\/june14\/mickens"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3559347"},{"key":"e_1_3_2_1_32_1","volume-title":"Cogsworth: Byzantine View Synchronization. https:\/\/arxiv.org\/pdf\/1909.05204.pdf","author":"Naor Oded","year":"2019","unstructured":"Oded Naor , Mathieu Baudet , Dahlia Malkhi , and Alexander Spiegelman . 2019 . Cogsworth: Byzantine View Synchronization. https:\/\/arxiv.org\/pdf\/1909.05204.pdf (2019). Oded Naor, Mathieu Baudet, Dahlia Malkhi, and Alexander Spiegelman. 2019. Cogsworth: Byzantine View Synchronization. https:\/\/arxiv.org\/pdf\/1909.05204.pdf (2019)."},{"key":"e_1_3_2_1_33_1","volume-title":"Expected Linear Round Synchronization: The Missing Link for Linear Byzantine SMR. ArXiv abs\/2002.07539","author":"Naor Oded","year":"2020","unstructured":"Oded Naor and Idit Keidar . 2020. Expected Linear Round Synchronization: The Missing Link for Linear Byzantine SMR. ArXiv abs\/2002.07539 ( 2020 ). Oded Naor and Idit Keidar. 2020. Expected Linear Round Synchronization: The Missing Link for Linear Byzantine SMR. ArXiv abs\/2002.07539 (2020)."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70697-9_14"},{"volume-title":"Proceedings of the 9th International Conference on Principles of Distributed Systems (OPODIS'05)","author":"HariGovind","key":"e_1_3_2_1_35_1","unstructured":"HariGovind V. Ramasamy and Christian Cachin. 2005. Parsimonious Asynchronous Byzantine-Fault-Tolerant Atomic Broadcast . In Proceedings of the 9th International Conference on Principles of Distributed Systems (OPODIS'05) . 88--102. HariGovind V. Ramasamy and Christian Cachin. 2005. Parsimonious Asynchronous Byzantine-Fault-Tolerant Atomic Broadcast. In Proceedings of the 9th International Conference on Principles of Distributed Systems (OPODIS'05). 88--102."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/191177.191194"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3559361"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.5070\/sr32159278"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3492321.3519579"},{"key":"e_1_3_2_1_40_1","unstructured":"The Diem Team. 2021. DiemBFT v4: State Machine Replication in the Diem Blockchain. (2021). https:\/\/developers.diem.com\/docs\/technical-papers\/state-machine-replication-paper.  The Diem Team. 2021. DiemBFT v4: State Machine Replication in the Diem Blockchain. (2021). https:\/\/developers.diem.com\/docs\/technical-papers\/state-machine-replication-paper."},{"key":"e_1_3_2_1_41_1","unstructured":"Gavin Wood. 2023. Polkadot: vision for a heterogeneous multi-chain framework. Cryptology ePrint Archive Paper 2023\/397. https:\/\/eprint.iacr.org\/2023\/397 https:\/\/eprint.iacr.org\/2023\/397.  Gavin Wood. 2023. Polkadot: vision for a heterogeneous multi-chain framework. Cryptology ePrint Archive Paper 2023\/397. https:\/\/eprint.iacr.org\/2023\/397 https:\/\/eprint.iacr.org\/2023\/397."},{"key":"e_1_3_2_1_42_1","volume-title":"Guy Golan Gueta, and Ittai Abraham","author":"Yin Maofan","year":"2018","unstructured":"Maofan Yin , Dahlia Malkhi , Michael K. Reiter , Guy Golan Gueta, and Ittai Abraham . 2018 . HotStuff: BFT Consensus in the Lens of Blockchain. CoRR abs\/1803.05069 (2018). arXiv:1803.05069 Maofan Yin, Dahlia Malkhi, Michael K. Reiter, Guy Golan Gueta, and Ittai Abraham. 2018. HotStuff: BFT Consensus in the Lens of Blockchain. CoRR abs\/1803.05069 (2018). arXiv:1803.05069"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331591"}],"event":{"name":"ApPLIED 2023: 5th workshop on Advanced tools, programming languages, and PLatforms for Implementing and Evaluating algorithms for Distributed systems","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGOPS ACM Special Interest Group on Operating Systems"],"location":"Orlando FL USA","acronym":"ApPLIED 2023"},"container-title":["Proceedings of the 5th workshop on Advanced tools, programming languages, and PLatforms for Implementing and Evaluating algorithms for Distributed systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3584684.3597268","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3584684.3597268","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:49:59Z","timestamp":1750268999000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3584684.3597268"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,19]]},"references-count":43,"alternative-id":["10.1145\/3584684.3597268","10.1145\/3584684"],"URL":"https:\/\/doi.org\/10.1145\/3584684.3597268","relation":{},"subject":[],"published":{"date-parts":[[2023,6,19]]},"assertion":[{"value":"2023-06-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}