{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T19:15:14Z","timestamp":1760728514516,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032052902"},{"type":"electronic","value":"9783032052919"}],"license":[{"start":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T00:00:00Z","timestamp":1758758400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T00:00:00Z","timestamp":1758758400000},"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-05291-9_9","type":"book-chapter","created":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T14:08:04Z","timestamp":1758722884000},"page":"215-236","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Actors and\u00a0Blockchains, Together"],"prefix":"10.1007","author":[{"given":"Xiaohong","family":"Chen","sequence":"first","affiliation":[]},{"given":"Grigore","family":"Rosu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,25]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1086.001.0001","volume-title":"Actors: A Model of Concurrent Computation in Distributed Systems","author":"GA Agha","year":"1986","unstructured":"Agha, G.A.: Actors: A Model of Concurrent Computation in Distributed Systems. MIT Press, Cambridge (1986)"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Baudet, M., Danezis, G., Sonnino, A.: FastPay: High-performance byzantine fault tolerant settlement. In: AFT \u201920: 2nd ACM Conference on Advances in Financial Technologies, New York, NY, USA, October 21-23, 2020, pp. 163\u2013177. ACM (2020)","DOI":"10.1145\/3419614.3423249"},{"key":"9_CR3","unstructured":"Chen, X., Rosu, G.: Fastset: Parallel claim settlement (2025)"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Kuznetsov, P., Monti, M., Pavlovic, M., Seredinschi, D.-A.: The consensus number of a cryptocurrency (extended version) (2019)","DOI":"10.1145\/3293611.3331589"},{"issue":"1","key":"9_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00446-021-00399-2","volume":"35","author":"R Guerraoui","year":"2022","unstructured":"Guerraoui, R., Kuznetsov, P., Monti, M., Pavlovic, M., Seredinschi, D.-A.: The consensus number of a cryptocurrency. Distrib. Comput. 35(1), 1\u201315 (2022)","journal-title":"Distrib. Comput."},{"issue":"3","key":"9_CR6","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M Herlihy","year":"1990","unstructured":"Herlihy, M., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12(3), 463\u2013492 (1990)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"9_CR7","unstructured":"Hewitt, C., Bishop, P.B., Steiger, R.: A universal modular ACTOR formalism for artificial intelligence. In: Proceedings of the 3rd International Joint Conference on Artificial Intelligence. Standford, CA, USA, August 20-23, 1973, pp. 235\u2013245. William Kaufmann (1973)"},{"issue":"7","key":"9_CR8","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L Lamport","year":"1978","unstructured":"Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21(7), 558\u2013565 (1978)","journal-title":"Commun. ACM"},{"issue":"2","key":"9_CR9","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)","journal-title":"ACM Trans. Comput. Syst."},{"key":"9_CR10","unstructured":"Mazurkiewicz, A.: Trace theory. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) Advances in Petri Nets 1986, Part II: Proceedings of an Advanced Course, Bad Honnef, 8.\u201319. September 1986, vol. 255. LNCS, pp. 279\u2013324. Springer (1987)"},{"key":"9_CR11","unstructured":"Nakamoto, S.: Bitcoin: A peer-to-peer electronic cash system, November 2008. Accessed: 2025-06-15"},{"key":"9_CR12","unstructured":"Ongaro, D., Ousterhout, J.K.: In search of an understandable consensus algorithm. In: Proceedings of the 2014 USENIX Annual Technical Conference, USENIX ATC 2014, Philadelphia, PA, USA, June 19-20, 2014, pp. 305\u2013320, Philadelphia, PA, June 2014. USENIX Association"},{"key":"9_CR13","unstructured":"Pregui\u00e7a, N., Shapiro, M., \u00a0Legatheaux Martins, J.: Designing a commutative replicated data type for cooperative editing systems. Research Report TR-02-2008 DI-FCT-UNL, Universidade Nova de Lisboa, Dep. Inform\u00e1tica, FCT (2008)"},{"key":"9_CR14","unstructured":"Shapiro, M., Pregui\u00e7a, N.: Designing a commutative replicated data type. Research Report RR-6320, Institut National de Recherche en Informatique et en Automatique (INRIA), October 2007"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/978-3-642-24550-3_29","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"M Shapiro","year":"2011","unstructured":"Shapiro, M., Pregui\u00e7a, N., Baquero, C., Zawirski, M.: Conflict-free replicated data types. In: D\u00e9fago, X., Petit, F., Villain, V. (eds.) SSS 2011. LNCS, vol. 6976, pp. 386\u2013400. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24550-3_29"}],"container-title":["Lecture Notes in Computer Science","Concurrent Programming, Open Systems and Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-05291-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T18:32:41Z","timestamp":1760725961000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-05291-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,25]]},"ISBN":["9783032052902","9783032052919"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-05291-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,9,25]]},"assertion":[{"value":"25 September 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}