{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T10:59:26Z","timestamp":1778065166754,"version":"3.51.4"},"publisher-location":"Cham","reference-count":56,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032070340","type":"print"},{"value":"9783032070357","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-07035-7_7","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:50:07Z","timestamp":1767315007000},"page":"108-126","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Consensus Under Adversary Majority Done Right"],"prefix":"10.1007","author":[{"given":"Srivatsan","family":"Sridhar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ertem Nusret","family":"Tas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joachim","family":"Neu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dionysis","family":"Zindros","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Tse","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"7_CR1","unstructured":"51% attacks. https:\/\/dci.mit.edu\/51-attacks. Accessed 15 Jan 2025"},{"key":"7_CR2","unstructured":"Tendermint spec (2022). https:\/\/github.com\/tendermint\/tendermint\/blob\/main\/spec\/README.md#p2p-and-network-protocols. Accessed 14 Jan 2025"},{"key":"7_CR3","unstructured":"CometBFT (2023). https:\/\/github.com\/cometbft\/cometbft\/blob\/2cd0d1a33cdb6a2c76e6e162d892624492c26290\/state\/validation.go#L45-L51. Accessed 14 Jan 2025"},{"key":"7_CR4","unstructured":"CometBFT (2024). https:\/\/github.com\/cometbft\/cometbft\/blob\/2cd0d1a33cdb6a2c76e6e162d892624492c26290\/consensus\/state.go#L1711-L1714. Accessed 14 Jan 2025"},{"key":"7_CR5","unstructured":"Ethereum consensus specs: Phase 0 \u2013 networking (2024). https:\/\/github.com\/ethereum\/consensus-specs\/blob\/dev\/specs\/phase0\/p2p-interface.md#global-topics. Accessed 15 Dec 2024"},{"key":"7_CR6","unstructured":"Abraham, I., Devadas, S., Nayak, K., Ren, L.: Brief announcement: practical synchronous byzantine consensus. In: DISC. LIPIcs, vol.\u00a091, pp. 41:1\u201341:4. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017)"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Abraham, I., Malkhi, D., Nayak, K., Ren, L., Yin, M.: Sync HotStuff: simple and practical synchronous state machine replication. In: SP, pp. 106\u2013118. IEEE (2020)","DOI":"10.1109\/SP40000.2020.00044"},{"key":"7_CR8","unstructured":"Bitcoin Project: Bitcoin developer guide \u2013 P2P network \u2013 initial block download \u2013 headers-first (2020). https:\/\/web.archive.org\/web\/20230314181737\/https:\/\/developer.bitcoin.org\/devguide\/p2p_network.html#headers-first"},{"key":"7_CR9","unstructured":"Buchman, E., Kwon, J., Milosevic, Z.: The latest gossip on BFT consensus. arXiv:1807.04938v3 [cs.DC] (2018)"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Budish, E., Lewis-Pye, A., Roughgarden, T.: The economic limits of permissionless consensus. arXiv:2405.09173v2 [cs.DC] (2024)","DOI":"10.1145\/3670865.3673548"},{"key":"7_CR11","unstructured":"Buterin, V.: A guide to 99% fault tolerant consensus (2018). https:\/\/vitalik.eth.limo\/general\/2018\/08\/07\/99_fault_tolerant.html. Accessed 11 Oct 2024"},{"key":"7_CR12","unstructured":"Buterin, V., Griffith, V.: Casper the friendly finality gadget. arXiv:1710.09437v4 [cs.CR] (2017)"},{"issue":"4","key":"7_CR13","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. 20(4), 398\u2013461 (2002)","journal-title":"ACM Trans. Comput. Syst."},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Chan, B.Y., Shi, E.: Streamlet: textbook streamlined blockchains. In: AFT, pp. 1\u201311. ACM (2020)","DOI":"10.1145\/3419614.3423256"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Coretti, S., Kiayias, A., Moore, C., Russell, A.: The generals\u2019 scuttlebutt: byzantine-resilient gossip protocols. In: CCS, pp. 595\u2013608. ACM (2022)","DOI":"10.1145\/3548606.3560638"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-030-32101-7_2","volume-title":"Financial Cryptography and Data Security","author":"P Daian","year":"2019","unstructured":"Daian, P., Pass, R., Shi, E.: Snow White: robustly reconfigurable consensus and applications to provably secure proof of stake. In: Goldberg, I., Moore, T. (eds.) FC 2019. LNCS, vol. 11598, pp. 23\u201341. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32101-7_2"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"D\u2019Amato, F., Neu, J., Tas, E.N., Tse, D.: Goldfish: No more attacks on ethereum?! In: FC (1). LNCS, vol. 14744, pp. 3\u201323. Springer, Cham (2024)","DOI":"10.1007\/978-3-031-78676-1_1"},{"key":"7_CR18","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: EuroSys, pp. 34\u201350. ACM (2022)","DOI":"10.1145\/3492321.3519594"},{"key":"7_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-319-78375-8_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"B David","year":"2018","unstructured":"David, B., Ga\u017ei, P., Kiayias, A., Russell, A.: Ouroboros praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10821, pp. 66\u201398. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_3"},{"issue":"4","key":"7_CR20","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1137\/0212045","volume":"12","author":"D Dolev","year":"1983","unstructured":"Dolev, D., Strong, H.R.: Authenticated algorithms for byzantine agreement. SIAM J. Comput. 12(4), 656\u2013666 (1983)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"7_CR21","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1145\/42282.42283","volume":"35","author":"C Dwork","year":"1988","unstructured":"Dwork, C., Lynch, N.A., Stockmeyer, L.J.: Consensus in the presence of partial synchrony. J. ACM 35(2), 288\u2013323 (1988)","journal-title":"J. ACM"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Garay, J.A., Kiayias, A., Leonardos, N.: The Bitcoin backbone protocol: analysis and applications. J. ACM 71(4), 25:1\u201325:49 (2024)","DOI":"10.1145\/3653445"},{"issue":"2","key":"7_CR23","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/564585.564601","volume":"33","author":"S Gilbert","year":"2002","unstructured":"Gilbert, S., Lynch, N.A.: Brewer\u2019s conjecture and the feasibility of consistent, available, partition-tolerant web services. SIGACT News 33(2), 51\u201359 (2002)","journal-title":"SIGACT News"},{"key":"7_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-662-64331-0_4","volume-title":"Financial Cryptography and Data Security","author":"V Goyal","year":"2021","unstructured":"Goyal, V., Li, H., Raizes, J.: Instant block confirmation in the sleepy model. In: Borisov, N., Diaz, C. (eds.) FC 2021. LNCS, vol. 12675, pp. 65\u201383. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-662-64331-0_4"},{"key":"7_CR25","doi-asserted-by":"crossref","unstructured":"Hou, R., Yu, H.: Optimistic fast confirmation while tolerating malicious majority in blockchains. In: SP, pp. 2481\u20132498. IEEE (2023)","DOI":"10.1109\/SP46215.2023.10179323"},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"Hou, R., Yu, H., Saxena, P.: Using throughput-centric byzantine broadcast to tolerate malicious majority in blockchains. In: SP, pp. 1263\u20131280. IEEE (2022)","DOI":"10.1109\/SP46214.2022.9833617"},{"key":"7_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-319-63688-7_12","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"A Kiayias","year":"2017","unstructured":"Kiayias, A., Russell, A., David, B., Oliynykov, R.: Ouroboros: a provably secure proof-of-stake blockchain protocol. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10401, pp. 357\u2013388. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_12"},{"issue":"3","key":"7_CR28","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R.E., Pease, M.C.: The byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"7_CR29","unstructured":"Leshno, J.D., Shi, E., Pass, R.: On the viability of open-source financial rails: economic security of permissionless consensus. arXiv:2409.08951v1 [cs.GT] (2024)"},{"key":"7_CR30","unstructured":"Lewis-Pye, A.: Consensus in 50 pages (rough draft) (2022). https:\/\/lewis-pye.com\/wp-content\/uploads\/2023\/01\/consensus-in-50-pages7-1.pdf. Accessed 11 Oct 2024"},{"key":"7_CR31","doi-asserted-by":"crossref","unstructured":"Lewis-Pye, A., Roughgarden, T.: How does blockchain security dictate blockchain implementation? In: CCS, pp. 1006\u20131019. ACM (2021)","DOI":"10.1145\/3460120.3484752"},{"key":"7_CR32","doi-asserted-by":"crossref","unstructured":"Lewis-Pye, A., Roughgarden, T.: Byzantine generals in the permissionless setting. In: FC (1). LNCS, vol. 13950, pp. 21\u201337. Springer, Cham (2023)","DOI":"10.1007\/978-3-031-47754-6_2"},{"key":"7_CR33","unstructured":"Lewis-Pye, A., Roughgarden, T.: Permissionless consensus. arXiv:2304.14701v5 [cs.DC] (2023)"},{"key":"7_CR34","unstructured":"Liu, S., Viotti, P., Cachin, C., Qu\u00e9ma, V., Vukolic, M.: XFT: practical fault tolerance beyond crashes. In: OSDI, pp. 485\u2013500. USENIX Association (2016)"},{"key":"7_CR35","doi-asserted-by":"crossref","unstructured":"Liu-Zhang, C., Matt, C., Maurer, U., Rito, G., Thomsen, S.E.: Practical provably secure flooding for blockchains. In: ASIACRYPT (1). LNCS, vol. 13791, pp. 774\u2013805. Springer, Cham (2022)","DOI":"10.1007\/978-3-031-22963-3_26"},{"key":"7_CR36","doi-asserted-by":"crossref","unstructured":"Liu-Zhang, C., Matt, C., Thomsen, S.E.: Asymptotically optimal message dissemination with applications to blockchains. In: EUROCRYPT (3). LNCS, vol. 14653, pp. 64\u201395. Springer, Cham (2024)","DOI":"10.1007\/978-3-031-58734-4_3"},{"key":"7_CR37","unstructured":"Losa, G., Gafni, E.: Consensus in the unknown-participation message-adversary model. arXiv:2301.04817v2 [cs.DC] (2023)"},{"key":"7_CR38","doi-asserted-by":"crossref","unstructured":"Malkhi, D., Momose, A., Ren, L.: Towards practical sleepy BFT. In: CCS, pp. 490\u2013503. ACM (2023)","DOI":"10.1145\/3576915.3623073"},{"key":"7_CR39","unstructured":"Malkhi, D., Nayak, K.: Extended abstract: HotStuff-2: optimal two-phase responsive BFT. Cryptology ePrint Archive, Paper 2023\/397 (2023)"},{"key":"7_CR40","doi-asserted-by":"crossref","unstructured":"Mazi\u00e8res, D., Shasha, D.E.: Building secure file systems out of byzantine storage. In: PODC, pp. 108\u2013117. ACM (2002)","DOI":"10.1145\/571825.571840"},{"key":"7_CR41","doi-asserted-by":"crossref","unstructured":"Momose, A., Ren, L.: Multi-threshold byzantine fault tolerance. In: CCS, pp. 1686\u20131699. ACM (2021)","DOI":"10.1145\/3460120.3484554"},{"key":"7_CR42","doi-asserted-by":"crossref","unstructured":"Momose, A., Ren, L.: Constant latency in sleepy consensus. In: CCS, pp. 2295\u20132308. ACM (2022)","DOI":"10.1145\/3548606.3559347"},{"key":"7_CR43","unstructured":"Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system (2008). https:\/\/bitcoin.org\/bitcoin.pdf. Accessed 11 Oct 2024"},{"key":"7_CR44","doi-asserted-by":"crossref","unstructured":"Neu, J., Sridhar, S., Yang, L., Tse, D.: Optimal flexible consensus and its application to Ethereum. In: SP, pp. 3885\u20133903. IEEE (2024)","DOI":"10.1109\/SP54263.2024.00135"},{"key":"7_CR45","doi-asserted-by":"crossref","unstructured":"Neu, J., Tas, E.N., Tse, D.: The availability-accountability dilemma and its resolution via accountability gadgets. arXiv:2105.06075v1 [cs.CR] (2021)","DOI":"10.1007\/978-3-031-18283-9_27"},{"key":"7_CR46","doi-asserted-by":"crossref","unstructured":"Neu, J., Tas, E.N., Tse, D.: Ebb-and-flow protocols: a resolution of the availability-finality dilemma. In: SP, pp. 446\u2013465. IEEE (2021)","DOI":"10.1109\/SP40001.2021.00045"},{"key":"7_CR47","doi-asserted-by":"crossref","unstructured":"Neu, J., Tas, E.N., Tse, D.: The availability-accountability dilemma and its resolution via accountability gadgets. In: Financial Cryptography. LNCS, vol. 13411, pp. 541\u2013559. Springer, Cham (2022)","DOI":"10.1007\/978-3-031-18283-9_27"},{"key":"7_CR48","doi-asserted-by":"crossref","unstructured":"Pass, R., Shi, E.: Rethinking large-scale consensus. In: CSF, pp. 115\u2013129. IEEE Computer Society (2017)","DOI":"10.1109\/CSF.2017.37"},{"key":"7_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/978-3-319-70697-9_14","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"R Pass","year":"2017","unstructured":"Pass, R., Shi, E.: The sleepy model of consensus. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10625, pp. 380\u2013409. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70697-9_14"},{"key":"7_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-78375-8_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"R Pass","year":"2018","unstructured":"Pass, R., Shi, E.: Thunderella: blockchains with optimistic instant confirmation. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10821, pp. 3\u201333. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_1"},{"issue":"4","key":"7_CR51","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1145\/98163.98167","volume":"22","author":"FB Schneider","year":"1990","unstructured":"Schneider, F.B.: Implementing fault-tolerant services using the state machine approach: a tutorial. ACM Comput. Surv. 22(4), 299\u2013319 (1990)","journal-title":"ACM Comput. Surv."},{"key":"7_CR52","doi-asserted-by":"crossref","unstructured":"Spiegelman, A., Giridharan, N., Sonnino, A., Kokoris-Kogias, L.: Bullshark: DAG BFT protocols made practical. In: CCS, pp. 2705\u20132718. ACM (2022)","DOI":"10.1145\/3548606.3559361"},{"key":"7_CR53","unstructured":"Sridhar, S., Tas, E.N., Neu, J., Zindros, D., Tse, D.: Consensus under adversary majority done right. Cryptology ePrint Archive, Paper 2024\/1799 (2024)"},{"key":"7_CR54","unstructured":"Sridhar, S., Zindros, D., Tse, D.: Better safe than sorry: recovering after adversarial majority. Cryptology ePrint Archive, Paper 2023\/1556 (2023)"},{"key":"7_CR55","doi-asserted-by":"crossref","unstructured":"Tas, E.N., Tse, D., Gai, F., Kannan, S., Maddah-Ali, M.A., Yu, F.: Bitcoin-enhanced proof-of-stake security: possibilities and impossibilities. In: SP, pp. 126\u2013145. IEEE (2023)","DOI":"10.1109\/SP46215.2023.10179426"},{"key":"7_CR56","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: PODC, 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-032-07035-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:50:10Z","timestamp":1767315010000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-07035-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032070340","9783032070357"],"references-count":56,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-07035-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 January 2026","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":"Miyakojima","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 April 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/fc25.ifca.ai\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}