{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,24]],"date-time":"2026-05-24T06:05:00Z","timestamp":1779602700351,"version":"3.53.1"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032264640","type":"print"},{"value":"9783032264657","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-26465-7_8","type":"book-chapter","created":{"date-parts":[[2026,5,24]],"date-time":"2026-05-24T05:50:26Z","timestamp":1779601826000},"page":"131-150","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Lightweight Approach for\u00a0State Machine Replication"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8967-9213","authenticated-orcid":false,"given":"Christian","family":"Cachin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-8852-5182","authenticated-orcid":false,"given":"Jinfeng","family":"Dou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5278-528X","authenticated-orcid":false,"given":"Christian","family":"Scheideler","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9660-1270","authenticated-orcid":false,"given":"Philipp","family":"Schneider","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,24]]},"reference":[{"key":"8_CR1","unstructured":"Ahmadi, M., Ghodselahi, A., Kuhn, F., Molla, A.R.: The cost of global broadcast in dynamic radio networks. In: Proceedings of\u00a0of OPODIS 2015 (2015)"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Amores-Sesar, I., Cachin, C., Schneider, P.: An analysis of avalanche consensus. In: Proceedings of SIROCCO 2024 (2024)","DOI":"10.1007\/978-3-031-60603-8_2"},{"issue":"2","key":"8_CR3","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s00446-008-0059-z","volume":"21","author":"D Angluin","year":"2008","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D.: A simple population protocol for fast robust approximate majority. Distrib. Comput. 21(2), 87\u2013102 (2008)","journal-title":"Distrib. Comput."},{"key":"8_CR4","unstructured":"Arun, B., Li, Z., Suri-Payer, F., Das, S., Spiegelman, A.: Shoal++: High throughput dag bft can be fast! ArXiv (2024)"},{"issue":"8","key":"8_CR5","doi-asserted-by":"publisher","first-page":"3885","DOI":"10.1137\/090751906","volume":"39","author":"H Attiya","year":"2010","unstructured":"Attiya, H., Censor-Hillel, K.: Lower bounds for randomized consensus under a weak adversary. SIAM J. Comput. 39(8), 3885\u20133904 (2010)","journal-title":"SIAM J. Comput."},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Avelas, D., Heydari, H., Alchieri, E., Distler, T., Bessani, A.: Probabilistic byzantine fault tolerance. In: Proceedings\u00a0of ACM PODC 2024 (2024)","DOI":"10.1145\/3662158.3662810"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Bar-Joseph, Z., Ben-Or, M.: A tight lower bound for randomized synchronous consensus. In: Proceedings\u00a0of ACM PODC 1998 (1998)","DOI":"10.1145\/277697.277733"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Becchetti, L., Clementi, A., Natale, E.: Consensus dynamics: an overview. SIGACT News 51(1), 58\u2013104 (2020)","DOI":"10.1145\/3388392.3388403"},{"issue":"2","key":"8_CR9","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/312203.312207","volume":"17","author":"KP Birman","year":"1999","unstructured":"Birman, K.P., Hayden, M., \u00d6zkasap, \u00d6., Xiao, Z., Budiu, M., Minsky, Y.: Bimodal multicast. ACM Trans. Comput. Syst. 17(2), 41\u201388 (1999)","journal-title":"ACM Trans. Comput. Syst."},{"key":"8_CR10","unstructured":"Buchman, E., Kwon, J., Milosevic, Z.: The latest gossip on BFT consensus. CoRR, abs\/1807.04938 (2018)"},{"key":"8_CR11","unstructured":"Cachin, C., Dou, J., Scheideler, C., Schneider, P.: A lightweight approach for state machine replication. CoRR, abs\/2509.17771 (2025)"},{"key":"8_CR12","unstructured":"Castro, M., Liskov, B.: Practical byzantine fault tolerance. In: Proceedings of OSDI 1999 (1999)"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Chun, B.-G., Maniatis, P., Shenker, S., Kubiatowicz, J.: Attested append-only memory: making adversaries stick to their word. In: Proceedings\u00a0of SOSP 2007 (2007)","DOI":"10.1145\/1294261.1294280"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Cruciani, A., Pasquale, F.: Dynamic graph models inspired by the bitcoin network-formation process. In: Proceedings\u00a0of ICDCN 2023 (2023)","DOI":"10.1145\/3571306.3571398"},{"key":"8_CR15","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\u00a0of EuroSys \u201922 (2022)","DOI":"10.1145\/3492321.3519594"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Doerr, B., Goldberg, L.A., Minder, L., Sauerwald, T., Scheideler, C.: Stabilizing consensus with the power of two choices. In: Proceedings\u00a0of ACM SPAA 2011 (2011)","DOI":"10.1145\/1989493.1989516"},{"key":"8_CR17","doi-asserted-by":"publisher","unstructured":"Gentry, C., et al: YOSO: you only speak once - secure MPC with stateless ephemeral roles. In: Proceedings\u00a0of CRYPTO 2021, pp. 64\u201393 (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_3","DOI":"10.1007\/978-3-030-84245-1_3"},{"issue":"2","key":"8_CR18","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":"8_CR19","doi-asserted-by":"crossref","unstructured":"Giridharan, N., Suri-Payer, F., Abraham, I., Alvisi, L.: and Natacha Crooks. Seamless high speed BFT. In: Proceedings of SOSP, Autobahn (2024)","DOI":"10.1145\/3694715.3695942"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Haeupler, B.: Analyzing network coding gossip made easy. In: Proceedings\u00a0of STOC 2011 (2011)","DOI":"10.1145\/1993636.1993676"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Haeupler, B., Mohapatra, J., Su, H.-H.: Optimal gossip algorithms for exact and approximate quantile computations. In: Proceedings\u00a0of ACM PODC 2018 (2018)","DOI":"10.1145\/3212734.3212770"},{"key":"8_CR22","unstructured":"Bitcoin Blockchain\u00a0Size (I:BBS) (2025). https:\/\/ycharts.com\/indicators\/bitcoin_blockchain_size"},{"key":"8_CR23","unstructured":"Karp, R.M., Schindelhauer, C., Shenker, S., V\u00f6cking, B.: Randomized rumor spreading. In: Proceedings\u00a0of FOCS 2000 (2000)"},{"key":"8_CR24","doi-asserted-by":"crossref","unstructured":"Keidar, I., Kokoris-Kogias, E., Naor, O., Spiegelman, A.: All you need is DAG. In: Proceedings\u00a0of ACM PODC 2021 (2021)","DOI":"10.1145\/3465084.3467905"},{"key":"8_CR25","unstructured":"Levin, D., Douceur, J.R., Lorch, J.R., Moscibroda, T.: Small trusted hardware for large distributed systems. In: Proceedings of NSDI, Trinc (2009)"},{"key":"8_CR26","doi-asserted-by":"crossref","unstructured":"Petersen, K., Spreitzer, M., Terry, D.B., Theimer, M., Demers, A.J.: Flexible update propagation for weakly consistent replication. In: Proceedings\u00a0of ACM SOSP 1997 (1997)","DOI":"10.1145\/268998.266711"},{"key":"8_CR27","doi-asserted-by":"crossref","unstructured":"Robinson, P., Scheideler, C., Setzer, A.: Breaking the $$\\omega (\\sqrt{\\log n})$$ barrier: Fast consensus under a late adversary. In: Proceedings\u00a0of ACM SPAA 2018 (2018)","DOI":"10.1145\/3210377.3210399"},{"key":"8_CR28","unstructured":"Team Rocket, Yin, M., Sekniqi, K., van Renesse, R., Sirer, E.G.: Scalable and probabilistic leaderless BFT consensus through metastability. CoRR, abs\/1906.08936 (2019)"},{"issue":"4","key":"8_CR29","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":"8_CR30","doi-asserted-by":"crossref","unstructured":"Spiegelman, A., Giridharan, N., Sonnino, A., Kokoris-Kogias, L.: Bullshark: DAG BFT protocols made practical. In: Proceedings of ACM CCS 2022, pp. 2705\u20132718 (2022)","DOI":"10.1145\/3548606.3559361"},{"key":"8_CR31","unstructured":"Peter Todd. Merkle mountain ranges (2012). https:\/\/github.com\/opentimestamps\/opentimestamps-server\/blob\/master\/doc\/merkle-mountain-range.md"},{"key":"8_CR32","doi-asserted-by":"crossref","unstructured":"van Renesse, R., Dumitriu, D., Gough, V., Thomas, C.: Efficient reconciliation and flow control for anti-entropy protocols. In: Proceedings\u00a0of LADIS 2008, pp. 6:1\u20136:7 (2008)","DOI":"10.1145\/1529974.1529983"},{"key":"8_CR33","doi-asserted-by":"crossref","unstructured":"Veronese, G.S., Correia, M., Bessani, A.N., Lung, L.C., Ver\u00edssimo, P.: Efficient byzantine fault-tolerance. IEEE Trans. Comput. 62(1), 16\u201330 (2013)","DOI":"10.1109\/TC.2011.221"},{"key":"8_CR34","first-page":"347","volume":"2019","author":"M Yin","year":"2019","unstructured":"Yin, M., Malkhi, D., Reiter, M.K., Golan-Gueta, G., Abraham, I.: Hotstuff: BFT consensus with linearity and responsiveness. Proc. of ACM PODC 2019, 347\u2013356 (2019)","journal-title":"Proc. of ACM PODC"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-26465-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,24]],"date-time":"2026-05-24T05:50:30Z","timestamp":1779601830000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-26465-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032264640","9783032264657"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-26465-7_8","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":"24 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SIROCCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Structural Information and Communication Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Durham","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"33","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sirocco2026.webspace.durham.ac.uk\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}