{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T02:43:57Z","timestamp":1781145837833,"version":"3.54.1"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030312763","type":"print"},{"value":"9783030312770","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-31277-0_11","type":"book-chapter","created":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T12:02:53Z","timestamp":1568376173000},"page":"166-182","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":34,"title":["Dissecting Tendermint"],"prefix":"10.1007","author":[{"given":"Yackolley","family":"Amoussou-Guenou","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Antonella","family":"Del Pozzo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Maria","family":"Potop-Butucaru","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sara","family":"Tucci-Piergiovanni","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,9,14]]},"reference":[{"key":"11_CR1","unstructured":"Livelock scenario. \n                      https:\/\/github.com\/tendermint\/tendermint\/wiki\/0.7-Livelock-Scenario\n                      \n                    . Accessed 14 Mar 2019"},{"key":"11_CR2","unstructured":"Abraham, I., Gueta, G., Malkhi, D.: Hot-stuff the linear, optimal-resilience, one-message BFT devil. CoRR abs\/1803.05069 (2018). \n                      http:\/\/arxiv.org\/abs\/1803.05069"},{"key":"11_CR3","unstructured":"Abraham, I., Malkhi, D., Nayak, K., Ren, L., Spiegelman, A.: Solidus: An incentive-compatible cryptocurrency based on permissionless byzantine consensus. CoRR, abs\/1612.02916 (2016)"},{"issue":"2","key":"11_CR4","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/992287.992298","volume":"35","author":"MK Aguilera","year":"2004","unstructured":"Aguilera, M.K.: A pleasant stroll through the land of infinitely many creatures. ACM Sigact News 35(2), 36\u201359 (2004)","journal-title":"ACM Sigact News"},{"key":"11_CR5","unstructured":"Amoussou-Guenou, Y., Del Pozzo, A., Potop-Butucaru, M., Tucci-Piergiovanni, S.: Correctness and Fairness of Tendermint-core Blockchains. CoRR abs\/1805.08429 (2018)"},{"key":"11_CR6","unstructured":"Amoussou-Guenou, Y., Del Pozzo, A., Potop-Butucaru, M., Tucci-Piergiovanni, S.: Correctness of tendermint-core blockchains. In: 22nd International Conference on Principles of Distributed Systems, OPODIS 2018, 17\u201319 December 2018, Hong Kong, China. pp. 16:1\u201316:16 (2018)"},{"key":"11_CR7","unstructured":"Amoussou-Guenou, Y., Del Pozzo, A., Potop-Butucaru, M., Tucci-Piergiovanni, S.: Dissecting Tendermint. Research report, LIP6, Sorbonne Universit\u00e9, CNRS, UMR 7606; CEA List (2018). \n                      https:\/\/hal.archives-ouvertes.fr\/hal-01881212v2"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Anceaume, E., Del Pozzo, A., Ludinard, R., Potop-Butucaru, M., Tucci-Piergiovanni, S.: Blockchain abstract data type. In: SPAA 2019 (2019, to appear)","DOI":"10.1145\/3323165.3323183"},{"key":"11_CR9","unstructured":"Androulaki, E., et al.: Hyperledger fabric: a distributed operating system for permissioned blockchains. In: Proceedings of the Thirteenth EuroSys Conference, EuroSys 2018, Porto, Portugal, 23\u201326 April 2018, pp. 30:1\u201330:15 (2018)"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-73940-1_1","volume-title":"Parallel Computing Technologies","author":"R Baldoni","year":"2007","unstructured":"Baldoni, R., Bertier, M., Raynal, M., Tucci-Piergiovanni, S.: Looking for a definition of dynamic distributed systems. In: Malyshkin, V. (ed.) PaCT 2007. LNCS, vol. 4671, pp. 1\u201314. Springer, Heidelberg (2007). \n                      https:\/\/doi.org\/10.1007\/978-3-540-73940-1_1"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Ben-Or, M.: Another advantage of free choice (extended abstract): completely asynchronous agreement protocols. In: Proceedings of the Second Annual ACM Symposium on Principles of Distributed Computing, pp. 27\u201330. ACM (1983)","DOI":"10.1145\/800221.806707"},{"key":"11_CR12","unstructured":"Buchman, E., Kwon, J., Milosevic, Z.: The latest gossip on BFT consensus. Technical report, Tendermint (2018). \n                      https:\/\/arxiv.org\/abs\/1807.04938"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/3-540-44647-8_31","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"C Cachin","year":"2001","unstructured":"Cachin, C., Kursawe, K., Petzold, F., Shoup, V.: Secure and efficient asynchronous broadcast protocols. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 524\u2013541. Springer, Heidelberg (2001). \n                      https:\/\/doi.org\/10.1007\/3-540-44647-8_31"},{"key":"11_CR14","unstructured":"Castro, M., Liskov, B.: Practical byzantine fault tolerance. In: Proceedings of the Symposium on Operating Systems Design and Implementation (OSDI) (1999)"},{"key":"11_CR15","unstructured":"Crain, T., Gramoli, V., Larrea, M., Raynal, M.: (Leader\/Randomization\/Signature)-free Byzantine Consensus for Consortium Blockchains (2017). \n                      http:\/\/csrg.redbellyblockchain.io\/doc\/ConsensusRedBellyBlockchain.pdf\n                      \n                    . Accessed 22 May 2018"},{"key":"11_CR16","unstructured":"Crain, T., Gramoli, V., Larrea, M., Raynal, M.: DBFT: Efficient byzantine consensus with a weak coordinator and its application to consortium blockchains. arXiv preprint \n                      arXiv:1702.03068\n                      \n                     (2017)"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Decker, C., Seidel, J., Wattenhofer, R.: Bitcoin meets strong consistency. In: Proceedings of the 17th International Conference on Distributed Computing and Networking Conference (ICDCN) (2016)","DOI":"10.1145\/2833312.2833321"},{"issue":"2","key":"11_CR18","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":"11_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/3-540-48071-4_10","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 92","author":"C Dwork","year":"1993","unstructured":"Dwork, C., Naor, M.: Pricing via processing or combatting junk mail. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 139\u2013147. Springer, Heidelberg (1993). \n                      https:\/\/doi.org\/10.1007\/3-540-48071-4_10"},{"issue":"4","key":"11_CR20","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0020-0190(82)90033-3","volume":"14","author":"MJ Fischer","year":"1982","unstructured":"Fischer, M.J., Lynch, N.A.: A lower bound for the time to assure interactive consistency. Inf. Process. Lett. 14(4), 183\u2013186 (1982)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"11_CR21","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":"11_CR22","doi-asserted-by":"crossref","unstructured":"Garay, J.A., Moses, Y.: Fully polynomial byzantine agreement in t+1 rounds. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 16\u201318 May 1993, San Diego, CA, USA, pp. 31\u201341 (1993)","DOI":"10.1145\/167088.167101"},{"key":"11_CR23","unstructured":"Kokoris-Kogias, E., Jovanovic, P., Gailly, N., Khoffi, I., Gasser, L., Ford, B.: Enhancing bitcoin security and performance with strong consistency via collective signing. In: Proceedings of the 25th USENIX Security Symposium (2016)"},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"Kowalski, D.R., Most\u00e9faoui, A.: Synchronous byzantine agreement with nearly a cubic number of communication bits: synchronous byzantine agreement with nearly a cubic number of communication bits. In: ACM Symposium on Principles of Distributed Computing, PODC 2013, Montreal, QC, Canada, 22\u201324 July 2013, pp. 84\u201391 (2013)","DOI":"10.1145\/2484239.2484271"},{"key":"11_CR25","unstructured":"Kwon, J., Buchman, E.: Cosmos: A Network of Distributed Ledgers. \n                      https:\/\/cosmos.network\/resources\/whitepaper\n                      \n                    . Accessed 22 May 2018"},{"key":"11_CR26","unstructured":"Kwon, J., Buchman, E.: Tendermint. \n                      https:\/\/tendermint.readthedocs.io\/en\/master\/specification.html\n                      \n                    . Accessed 22 May 2018"},{"issue":"3","key":"11_CR27","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. Programm. Lang. Syst. 4(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Programm. Lang. Syst."},{"issue":"1","key":"11_CR28","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1515\/comp-2018-0014","volume":"8","author":"Francesc D. Mu\u00f1oz-Esco\u00ed","year":"2018","unstructured":"Mu\u00f1oz-Esco\u00ed, F.D., de\u00a0Juan-Mar\u00edn, R.: On synchrony in dynamic distributed systems. Open Comput. Sci. 8(1), 154\u2013164(2018). \n                      https:\/\/doi.org\/10.1515\/comp-2018-0014","journal-title":"Open Computer Science"},{"issue":"2","key":"11_CR29","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)","journal-title":"J. ACM"},{"key":"11_CR30","unstructured":"Tendermint: correctness issues. \n                      https:\/\/github.com\/tendermint\/spec\/issues\n                      \n                    . Accessed 24 Sept 2018"},{"key":"11_CR31","unstructured":"Tendermint: Tendermint Core (BFT Consensus) in Go. \n                      https:\/\/github.com\/tendermint\/tendermint\/blob\/e88f74bb9bb9edb9c311f256037fcca217b45ab6\/consensus\/state.go\n                      \n                    . Accessed 22 May 2018"}],"container-title":["Lecture Notes in Computer Science","Networked Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-31277-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T12:06:18Z","timestamp":1568376378000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-31277-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030312763","9783030312770"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-31277-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"14 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NETYS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Networked Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Marrakech","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"netys2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/netys.net\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"60","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.91","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.68","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}