{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:15:37Z","timestamp":1743088537574,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031404351"},{"type":"electronic","value":"9783031404368"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-40436-8_6","type":"book-chapter","created":{"date-parts":[[2023,9,7]],"date-time":"2023-09-07T23:04:03Z","timestamp":1694127843000},"page":"136-162","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Consensus Machine: Formalising Consensus in\u00a0the\u00a0Presence of\u00a0Malign Agents"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7557-3901","authenticated-orcid":false,"given":"A. W.","family":"Roscoe","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5627-0910","authenticated-orcid":false,"given":"Pedro","family":"Antonino","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0001-4884-6684","authenticated-orcid":false,"given":"Jonathan","family":"Lawrence","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,8]]},"reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-662-53357-4_10","volume-title":"Financial Cryptography and Data Security","author":"I Bentov","year":"2016","unstructured":"Bentov, I., Gabizon, A., Mizrahi, A.: Cryptocurrencies without proof of work. In: Clark, J., Meiklejohn, S., Ryan, P.Y.A., Wallach, D., Brenner, M., Rohloff, K. (eds.) FC 2016. LNCS, vol. 9604, pp. 142\u2013157. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53357-4_10"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Brookes, S.D., Roscoe, A.W.: CSP: A Practical Process Algebra, 1 edn., pp. 187\u2013222. Association for Computing Machinery, New York (2021)","DOI":"10.1145\/3477355.3477365"},{"key":"6_CR3","unstructured":"Buchman, E., Kwon, J., Milosevic, Z.: The latest gossip on BFT consensus. CoRR abs\/1807.04938 (2018). http:\/\/arxiv.org\/abs\/1807.04938"},{"key":"6_CR4","unstructured":"Buterin, V.: Ethereum: a next-generation smart contract and decentralized application Platform (2014). https:\/\/ethereum.org\/whitepaper\/"},{"key":"6_CR5","unstructured":"Buterin, V., Griffith, V.: Casper the friendly finality gadget. CoRR abs\/1710.09437 (2017). http:\/\/arxiv.org\/abs\/1710.09437"},{"key":"6_CR6","doi-asserted-by":"publisher","unstructured":"Camenisch, J., Drijvers, M., Hanke, T., Pignolet, Y.A., Shoup, V., Williams, D.: Internet computer consensus. In: Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing, PODC 2022, pp. 81\u201391. Association for Computing Machinery, New York (2022). https:\/\/doi.org\/10.1145\/3519270.3538430","DOI":"10.1145\/3519270.3538430"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"76","DOI":"10.3905\/jpm.2008.709984","volume":"34","author":"K Dowd","year":"2008","unstructured":"Dowd, K., Cotter, J., Humphrey, C., Woods, M.: How unlucky is 25-sigma? J. Portfolio Manag. 34, 76\u201380 (2008). https:\/\/doi.org\/10.3905\/jpm.2008.709984","journal-title":"J. Portfolio Manag."},{"issue":"2","key":"6_CR8","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1145\/42282.42283","volume":"35","author":"C Dwork","year":"1988","unstructured":"Dwork, C., Lynch, N., Stockmeyer, L.: Consensus in the presence of partial synchrony. J. ACM (JACM) 35(2), 288\u2013323 (1988)","journal-title":"J. ACM (JACM)"},{"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.S.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-642-54862-8_13","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"T Gibson-Robinson","year":"2014","unstructured":"Gibson-Robinson, T., Armstrong, P., Boulgakov, A., Roscoe, A.W.: FDR3\u2014a modern refinement checker for CSP. In: \u00c1brah\u00e1m, E., Havelund, K. (eds.) TACAS 2014. LNCS, vol. 8413, pp. 187\u2013201. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54862-8_13"},{"issue":"5","key":"6_CR11","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1007\/s10009-019-00516-4","volume":"21","author":"T Gibson-Robinson","year":"2019","unstructured":"Gibson-Robinson, T., Lowe, G.: Symmetry reduction in CSP model checking. Int. J. Softw. Tools Technol. Transfer 21(5), 567\u2013605 (2019). https:\/\/doi.org\/10.1007\/s10009-019-00516-4","journal-title":"Int. J. Softw. Tools Technol. Transfer"},{"key":"6_CR12","doi-asserted-by":"publisher","unstructured":"Gilad, Y., Hemo, R., Micali, S., Vlachos, G., Zeldovich, N.: Algorand: scaling byzantine agreements for cryptocurrencies. In: Proceedings of the 26th Symposium on Operating Systems Principles, SOSP 2017, pp. 51\u201368. Association for Computing Machinery, New York (2017). https:\/\/doi.org\/10.1145\/3132747.3132757","DOI":"10.1145\/3132747.3132757"},{"issue":"3","key":"6_CR13","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0167-6423(87)90035-9","volume":"8","author":"D Harel","year":"1987","unstructured":"Harel, D.: Statecharts: a visual formalism for complex systems. Sci. Comput. Program. 8(3), 231\u2013274 (1987)","journal-title":"Sci. Comput. Program."},{"key":"6_CR14","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. International Series in Computer Science. Prentice Hall (1985)"},{"key":"6_CR15","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"},{"key":"6_CR16","unstructured":"King, S., Nadal, S.: Ppcoin: peer-to-peer crypto-currency with proof-of-stake. Self-published paper, 19 August 2012"},{"issue":"2","key":"6_CR17","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1145\/279227.279229","volume":"16","author":"L Lamport","year":"1998","unstructured":"Lamport, L.: The part-time parliament. ACM Trans. Comput. Syst. 16(2), 133\u2013169 (1998). https:\/\/doi.org\/10.1145\/279227.279229","journal-title":"ACM Trans. Comput. Syst."},{"issue":"3","key":"6_CR18","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R., Pease, M.: The Byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382\u2013401 (1982). https:\/\/doi.org\/10.1145\/357172.357176","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"6_CR19","doi-asserted-by":"publisher","unstructured":"Li, X., Zhu, Q., Qi, N., Huang, J., Yuan, Y., Wang, F.Y.: Blockchain consensus algorithms: a survey. In: 2021 China Automation Congress (CAC), pp. 4053\u20134058 (2021). https:\/\/doi.org\/10.1109\/CAC53003.2021.9728000","DOI":"10.1109\/CAC53003.2021.9728000"},{"issue":"6","key":"6_CR20","doi-asserted-by":"publisher","first-page":"1811","DOI":"10.1145\/197320.197383","volume":"16","author":"BH Liskov","year":"1994","unstructured":"Liskov, B.H., Wing, J.M.: A behavioral notion of subtyping. ACM Trans. Program. Lang. Syst. 16(6), 1811\u20131841 (1994). https:\/\/doi.org\/10.1145\/197320.197383","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"1\u20132","key":"6_CR21","doi-asserted-by":"publisher","first-page":"53","DOI":"10.3233\/JCS-1998-61-204","volume":"6","author":"G Lowe","year":"1998","unstructured":"Lowe, G.: Casper: a compiler for the analysis of security protocols. J. Comput. Secur. 6(1\u20132), 53\u201384 (1998)","journal-title":"J. Comput. Secur."},{"key":"6_CR22","unstructured":"Nakamoto, S., et al.: Bitcoin: a peer-to-peer electronic cash system (2008)"},{"key":"6_CR23","unstructured":"Ongaro, D., Ousterhout, J.: In search of an understandable consensus algorithm. In: Proceedings of the 2014 USENIX Conference on USENIX Annual Technical Conference, USENIX ATC 2014, pp. 305\u2013320. USENIX Association (2014)"},{"issue":"2","key":"6_CR24","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M Pease","year":"1980","unstructured":"Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. J. ACM 27(2), 228\u2013234 (1980). https:\/\/doi.org\/10.1145\/322186.322188","journal-title":"J. ACM"},{"key":"6_CR25","doi-asserted-by":"publisher","unstructured":"Rabin, M.O.: Randomized byzantine generals. In: 24th Annual Symposium on Foundations of Computer Science (SFCS 1983), pp. 403\u2013409 (1983). https:\/\/doi.org\/10.1109\/SFCS.1983.48","DOI":"10.1109\/SFCS.1983.48"},{"key":"6_CR26","unstructured":"Roscoe, A.W.: Model-checking CSP. In: International Series in Computer Science. Prentice Hall (1994). http:\/\/www.cs.ox.ac.uk\/people\/bill.roscoe\/publications\/50.ps"},{"key":"6_CR27","unstructured":"Roscoe, A.W.: The Theory and Practice of Concurrency. Series in Computer Science. Prentice Hall (1998)"},{"key":"6_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84882-258-0","volume-title":"Understanding Concurrent Systems","author":"AW Roscoe","year":"2010","unstructured":"Roscoe, A.W.: Understanding Concurrent Systems. Springer, London (2010). https:\/\/doi.org\/10.1007\/978-1-84882-258-0"},{"key":"6_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/3-540-60630-0_7","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"AW Roscoe","year":"1995","unstructured":"Roscoe, A.W., Gardiner, P.H.B., Goldsmith, M.H., Hulance, J.R., Jackson, D.M., Scattergood, J.B.: Hierarchical compression for model-checking CSP or how to check 1020 dining philosophers for deadlock. In: Brinksma, E., Cleaveland, W.R., Larsen, K.G., Margaria, T., Steffen, B. (eds.) TACAS 1995. LNCS, vol. 1019, pp. 133\u2013152. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60630-0_7"},{"key":"6_CR30","unstructured":"Wood, G.: Ethereum yellow paper. https:\/\/ethereum.github.io\/yellowpaper\/paper.pdf"},{"issue":"2","key":"6_CR31","doi-asserted-by":"publisher","first-page":"1432","DOI":"10.1109\/COMST.2020.2969706","volume":"22","author":"Y Xiao","year":"2020","unstructured":"Xiao, Y., Zhang, N., Lou, W., Hou, Y.T.: A survey of distributed consensus protocols for blockchain networks. IEEE Commun. Surv. Tutor. 22(2), 1432\u20131465 (2020). https:\/\/doi.org\/10.1109\/COMST.2020.2969706","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"6_CR32","doi-asserted-by":"publisher","unstructured":"Yin, M., Malkhi, D., Reiter, M.K., Gueta, G.G., Abraham, I.: HotStuff: BFT consensus with linearity and responsiveness. In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC 2019, pp. 347\u2013356. Association for Computing Machinery, New York (2019). https:\/\/doi.org\/10.1145\/3293611.3331591","DOI":"10.1145\/3293611.3331591"}],"container-title":["Lecture Notes in Computer Science","Theories of Programming and Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-40436-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,7]],"date-time":"2023-09-07T23:05:19Z","timestamp":1694127919000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-40436-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031404351","9783031404368"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-40436-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"8 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}