{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,25]],"date-time":"2026-07-25T15:57:00Z","timestamp":1784995020832,"version":"3.55.0"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031786754","type":"print"},{"value":"9783031786761","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-78676-1_6","type":"book-chapter","created":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T06:50:31Z","timestamp":1740120631000},"page":"92-109","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Shoal: Improving DAG-BFT Latency and Robustness"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Spiegelman","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Balaji","family":"Arun","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rati","family":"Gelashvili","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zekun","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,2,22]]},"reference":[{"issue":"9","key":"6_CR1","doi-asserted-by":"publisher","first-page":"1739","DOI":"10.14778\/3538598.3538599","volume":"15","author":"B Arun","year":"2022","unstructured":"Arun, B., Ravindran, B.: Scalable byzantine fault tolerance via partial decentralization. Proc. VLDB Endow. 15(9), 1739\u20131752 (2022)","journal-title":"Proc. VLDB Endow."},{"key":"6_CR2","unstructured":"Baird, L.: The swirlds hashgraph consensus algorithm: fair, fast, byzantine fault tolerance. Swirlds Tech Reports SWIRLDS-TR-2016-01, Technical report (2016)"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Bessani, A., Sousa, J., Alchieri, E.E.P.: State machine replication for the masses with BFT-smart. In: 2014 44th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks, pp. 355\u2013362. IEEE (2014)","DOI":"10.1109\/DSN.2014.43"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-45682-1_30","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"D Boneh","year":"2001","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 514\u2013532. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_30"},{"key":"6_CR5","unstructured":"Buchman, E., Kwon, J., Milosevic, Z.: The latest gossip on BFT consensus. arXiv preprint arXiv:1807.04938 (2018)"},{"issue":"4","key":"6_CR6","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1145\/571637.571640","volume":"20","author":"M Castro","year":"2002","unstructured":"Castro, M., Liskov, B.: Practical byzantine fault tolerance and proactive recovery. ACM Trans. Comput. Syst. (TOCS) 20(4), 398\u2013461 (2002)","journal-title":"ACM Trans. Comput. Syst. (TOCS)"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-031-18283-9_13","volume-title":"FC 2022","author":"S Cohen","year":"2022","unstructured":"Cohen, S., et al.: Be aware of your leaders. In: Eyal, I., Garay, J. (eds.) FC 2022. LNCS, vol. 13411, pp. 279\u2013295. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-18283-9_13"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Danezis, G., Kokoris-Kogias, L., Sonnino, A., Spiegelman, A.: Narwhal and tusk: a DAG-based mempool and efficient BFT consensus. In: Proceedings of the Seventeenth European Conference on Computer Systems, pp. 34\u201350 (2022)","DOI":"10.1145\/3492321.3519594"},{"issue":"2","key":"6_CR9","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"key":"6_CR10","unstructured":"Ford, B.: Threshold logical clocks for asynchronous distributed coordination and consensus. arXiv preprint arXiv:1907.07010 (2019)"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"G\u0105gol, A., Le\u015bniak, D., Straszak, D., \u015awi\u0119tek, M.: Aleph: efficient atomic broadcast in asynchronous networks with byzantine nodes. In: Proceedings of the 1st ACM Conference on Advances in Financial Technologies, pp. 214\u2013228 (2019)","DOI":"10.1145\/3318041.3355467"},{"key":"6_CR12","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-031-18283-9_14","volume-title":"FC 2022","author":"R Gelashvili","year":"2022","unstructured":"Gelashvili, R., Kokoris-Kogias, L., Sonnino, A., Spiegelman, A., Xiang, Z.: Jolteon and Ditto: network-adaptive efficient consensus with asynchronous fallback. In: Eyal, I., Garay, J. (eds.) FC 2022. LNCS, vol. 13411, pp. 296\u2013315. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-18283-9_14"},{"key":"6_CR13","unstructured":"Giridharan, N., Howard, H., Abraham, I., Crooks, N., Tomescu, A.: Defeating livelock in BFT. Cryptology ePrint Archive, No-commit proofs (2021)"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Kne\u017eevi\u0107, N., Qu\u00e9ma, V., Vukoli\u0107, M.: The next 700 BFT protocols. In: Proceedings of the 5th European Conference on Computer Systems, pp. 363\u2013376 (2010)","DOI":"10.1145\/1755913.1755950"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Gueta, G.G., et al.: SBFT: a scalable and decentralized trust infrastructure. In: 2019 49th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks (DSN), pp. 568\u2013580. IEEE (2019)","DOI":"10.1109\/DSN.2019.00063"},{"key":"6_CR16","unstructured":"Jalalzai, M.M., Niu, J., Feng, C., Gai, F.: Fast-Hotstuff: a fast and resilient Hotstuff protocol. arXiv preprint arXiv:2010.11454 (2020)"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Kapitza, R., et al.: CheapBFT: resource-efficient byzantine fault tolerance. In: Proceedings of the 7th ACM European Conference on Computer Systems, pp. 295\u2013308 (2012)","DOI":"10.1145\/2168836.2168866"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Keidar, I., Kokoris-Kogias, E., Naor, O., Spiegelman, A.: All you need is DAG. In: Proceedings of the 40th Symposium on Principles of Distributed Computing, PODC 2021. Association for Computing Machinery, New York (2021)","DOI":"10.1145\/3465084.3467905"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Kotla, R., Alvisi, L., Dahlin, M., Clement, A., Wong, E.: Zyzzyva: speculative byzantine fault tolerance. In: Proceedings of Twenty-First ACM SIGOPS Symposium on Operating Systems Principles, pp. 45\u201358 (2007)","DOI":"10.1145\/1323293.1294267"},{"key":"6_CR20","unstructured":"Spiegelman, A., Aurn, B., Gelashvili, R., Li, Z.: Shoal: improving DAG-BFT latency and robustness. arXiv preprint arXiv:2306.03058 (2023)"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Spiegelman, A., Giridharan, N., Sonnino, A., Kokoris-Kogias, L.: Bullshark: DAG BFT protocols made practical. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, pp. 2705\u20132718 (2022)","DOI":"10.1145\/3548606.3559361"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Spiegelman, A., Giridharan, N., Sonnino, A., Kokoris-Kogias, L.: Bullshark: the partially synchronous version. arXiv preprint arXiv:2209.05633 (2022)","DOI":"10.1145\/3548606.3559361"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Stathakopoulou, C., Pavlovic, M., Vukoli\u0107, M.: State machine replication scalability made simple. In: Proceedings of the Seventeenth European Conference on Computer Systems, pp. 17\u201333 (2022)","DOI":"10.1145\/3492321.3519579"},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"Stathakopoulou, C., Tudor, D., Pavlovic, M., Vukoli\u0107, M.: [solution] Mir-BFT: scalable and robust BFT for decentralized networks. J. Syst. Res. 2(1) (2022)","DOI":"10.5070\/SR32159278"},{"key":"6_CR25","unstructured":"The\u00a0Aptos Team: Aptos networks (2022). Accessed May 2023"},{"key":"6_CR26","unstructured":"The\u00a0Avalanche Team: Avalanche networks (2020). Accessed May 2023"},{"key":"6_CR27","doi-asserted-by":"crossref","unstructured":"The\u00a0Celo Team: Celo networks (2020). Accessed May 2023","DOI":"10.5465\/AMPROC.2023.12166abstract"},{"key":"6_CR28","unstructured":"The\u00a0Definity Team: Definity networks (2018). Accessed May 2023"},{"key":"6_CR29","unstructured":"The\u00a0Diem Team: Diembftv4 (2021). Accessed May 2023"},{"key":"6_CR30","unstructured":"The\u00a0Solana Team: Solana networks (2020). Accessed May 2023"},{"key":"6_CR31","unstructured":"The\u00a0Sui Team: Sui networks (2023). Accessed May 2023"},{"key":"6_CR32","unstructured":"Yang, L., Park, S.J., Alizadeh, M., Kannan, S., Tse, D.: $$\\{$$DispersedLedger$$\\}$$:$$\\{$$High-Throughput$$\\}$$ byzantine consensus on variable bandwidth networks. In: 19th USENIX Symposium on Networked Systems Design and Implementation (NSDI 2022), pp. 493\u2013512 (2022)"},{"key":"6_CR33","doi-asserted-by":"crossref","unstructured":"Yin, M., Malkhi, D., Reiter, M.K., Golan-Gueta, G., Abraham, I.: Hotstuff: BFT consensus with linearity and responsiveness. In: Robinson, P., Ellen, F. (eds.) Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC 2019, Toronto, ON, Canada, July 29 - August 2, 2019, pp. 347\u2013356. ACM (2019)","DOI":"10.1145\/3293611.3331591"}],"container-title":["Lecture Notes in Computer Science","Financial Cryptography and Data Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-78676-1_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T06:52:16Z","timestamp":1740120736000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-78676-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031786754","9783031786761"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-78676-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"22 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Financial Cryptography and Data Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Willemstad","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cura\u00e7ao","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 March 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 March 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/fc24.ifca.ai\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}