{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T18:03:48Z","timestamp":1764785028344,"version":"build-2065373602"},"reference-count":36,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T00:00:00Z","timestamp":1673049600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"FCT\/MCTES","award":["UIDB\/EEA\/50008\/2020","UIDB\/04516\/2020","Centro-01-0145-FEDER-000019-C4","UIDB\/05064\/2020"],"award-info":[{"award-number":["UIDB\/EEA\/50008\/2020","UIDB\/04516\/2020","Centro-01-0145-FEDER-000019-C4","UIDB\/05064\/2020"]}]},{"name":"NOVA LINCS","award":["UIDB\/EEA\/50008\/2020","UIDB\/04516\/2020","Centro-01-0145-FEDER-000019-C4","UIDB\/05064\/2020"],"award-info":[{"award-number":["UIDB\/EEA\/50008\/2020","UIDB\/04516\/2020","Centro-01-0145-FEDER-000019-C4","UIDB\/05064\/2020"]}]},{"name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","award":["UIDB\/EEA\/50008\/2020","UIDB\/04516\/2020","Centro-01-0145-FEDER-000019-C4","UIDB\/05064\/2020"],"award-info":[{"award-number":["UIDB\/EEA\/50008\/2020","UIDB\/04516\/2020","Centro-01-0145-FEDER-000019-C4","UIDB\/05064\/2020"]}]},{"name":"Centro de Compet\u00eancias em Cloud Computing","award":["UIDB\/EEA\/50008\/2020","UIDB\/04516\/2020","Centro-01-0145-FEDER-000019-C4","UIDB\/05064\/2020"],"award-info":[{"award-number":["UIDB\/EEA\/50008\/2020","UIDB\/04516\/2020","Centro-01-0145-FEDER-000019-C4","UIDB\/05064\/2020"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>This paper presents the research undertaken with the goal of designing a consensus algorithm for cryptocurrencies with less latency than the current state-of-the-art while maintaining a level of throughput and scalability sufficient for real-world payments. The result is Nero, a new deterministic leaderless byzantine consensus algorithm in the partially synchronous model that is especially suited for Directed Acyclic Graph (DAG)-based cryptocurrencies. In fact, Nero has a communication complexity of O(n3) and terminates in two message delays in the good case (when there is synchrony). The algorithm is shown to be correct, and we also show that it can provide eventual order. Finally, some performance results are given based on a proof of concept implementation in the Rust language.<\/jats:p>","DOI":"10.3390\/a16010038","type":"journal-article","created":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T04:47:08Z","timestamp":1673239628000},"page":"38","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Nero: A Deterministic Leaderless Consensus Algorithm for DAG-Based Cryptocurrencies"],"prefix":"10.3390","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5040-4164","authenticated-orcid":false,"given":"Rui","family":"Morais","sequence":"first","affiliation":[{"name":"Department of Informatics, University of Beira Interior, 6201-001 Covilh\u00e3, Portugal"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6824-6136","authenticated-orcid":false,"given":"Paul","family":"Crocker","sequence":"additional","affiliation":[{"name":"Department of Informatics, University of Beira Interior, 6201-001 Covilh\u00e3, Portugal"},{"name":"Instituto de Telecomunica\u00e7\u00f5es and Department of Informatics, University of Beira Interior, 6201-001 Covilh\u00e3, Portugal"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0446-9271","authenticated-orcid":false,"given":"Valderi","family":"Leithardt","sequence":"additional","affiliation":[{"name":"VALORIZA\u2014Research Centre for Endogenous Resource Valorization, Polytechnic Institute of Portalegre, 7300-110 Portalegre, Portugal"},{"name":"COPELABS, Lus\u00f3fona University of Humanities and Technologies, Campo Grande 376, 1749-024 Lisboa, Portugal"}]}],"member":"1968","published-online":{"date-parts":[[2023,1,7]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1145\/322186.322188","article-title":"Reaching Agreement in the Presence of Faults","volume":"27","author":"Pease","year":"1980","journal-title":"J. Assoc. Comput. Mach."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/357172.357176","article-title":"The Byzantine Generals Problem","volume":"4","author":"Lamport","year":"1982","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1137\/0212045","article-title":"Authenticated Algorithms for Byzantine Agreement","volume":"12","author":"Dolev","year":"1983","journal-title":"SIAM J. Comput."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1145\/3149.214121","article-title":"Impossibility of Distributed Consensus with One Faulty Process","volume":"32","author":"Fischer","year":"1985","journal-title":"J. ACM"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Miller, A., Xia, Y., Croman, K., Shi, E., and Song, D. (2016, January 24\u201328). The Honey Badger of BFT Protocols. Proceedings of the CCS \u201916: 2016 ACM SIGSAC Conference on Computer and Communications Security, Vienna, Austria.","DOI":"10.1145\/2976749.2978399"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1145\/42282.42283","article-title":"Consensus in the Presence of Partial Synchrony","volume":"35","author":"Dwork","year":"1988","journal-title":"J. ACM"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1093\/comjnl\/bxh145","article-title":"From Consensus to Atomic Broadcast: Time-Free Byzantine-Resistant Protocols without Signatures","volume":"49","author":"Correia","year":"2006","journal-title":"Comput. J."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1093\/comjnl\/46.1.16","article-title":"Byzantine Fault Detectors for Solving Consensus","volume":"46","author":"Kihlstrom","year":"2003","journal-title":"Comput. J."},{"key":"ref_9","unstructured":"Haeberlen, A., Kuznetsov, P., and Druschel, P. (2006, January 8). The case for Byzantine fault detection. Proceedings of the Second Conference on Hot Topics in System Dependability, Seattle, WA, USA."},{"key":"ref_10","unstructured":"Nakamoto, S. (2022, October 15). Bitcoin: A Peer-to-Peer Electronic Cash System. Available online: https:\/\/bitcoin.org\/bitcoin.pdf."},{"key":"ref_11","first-page":"943","article-title":"Analysis of Nakamoto Consensus","volume":"2019","author":"Ren","year":"2019","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"1156","DOI":"10.1093\/rfs\/hhaa075","article-title":"Blockchain without Waste: Proof-of-Stake","volume":"34","author":"Saleh","year":"2020","journal-title":"Rev. Financ. Stud."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Katz, J., and Shacham, H. (2017, January 20\u201324). Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol. Proceedings of the Advances in Cryptology\u2014CRYPTO 2017, Santa Barbara, CA, USA.","DOI":"10.1007\/978-3-319-63697-9"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Garcia-Alfaro, J., Navarro-Arribas, G., Hartenstein, H., and Herrera-Joancomart\u00ed, J. (2017, January 14\u201315). Securing Proof-of-Stake Blockchain Protocols. Proceedings of the Data Privacy Management, Cryptocurrencies and Blockchain Technology, Oslo, Norway.","DOI":"10.1007\/978-3-319-67816-0"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1145\/98163.98167","article-title":"Implementing Fault-Tolerant Services Using the State Machine Approach: A Tutorial","volume":"22","author":"Schneider","year":"1990","journal-title":"ACM Comput. Surv."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1016\/j.dcan.2019.12.001","article-title":"Performance analysis and comparison of PoW, PoS and DAG based blockchains","volume":"6","author":"Cao","year":"2020","journal-title":"Digit. Commun. Netw."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Baird, L., and Luykx, A. (September, January 31). The Hashgraph Protocol: Efficient Asynchronous BFT for High-Throughput Distributed Ledgers. Proceedings of the 2020 International Conference on Omni-layer Intelligent Systems (COINS), Barcelona, Spain.","DOI":"10.1109\/COINS49042.2020.9191430"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Danezis, G., Kokoris-Kogias, L., Sonnino, A., and Spiegelman, A. (2022, January 5\u20138). Narwhal and Tusk: A DAG-Based Mempool and Efficient BFT Consensus. Proceedings of the EuroSys \u201922: Seventeenth European Conference on Computer Systems, Rennes, France.","DOI":"10.1145\/3492321.3519594"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Keidar, I., Kokoris-Kogias, E., Naor, O., and Spiegelman, A. (2021, January 26\u201330). All You Need is DAG. Proceedings of the PODC\u201921: 2021 ACM Symposium on Principles of Distributed Computing, Virtual Event.","DOI":"10.1145\/3465084.3467905"},{"key":"ref_20","unstructured":"Chen, T.Y., Huang, W.N., Kuo, P.C., Chung, H., and Chao, T.W. (2018). DEXON: A Highly Scalable, Decentralized DAG-Based Consensus Algorithm. arXiv."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"M\u00fcller, S., Penzkofer, A., Polyanskii, N., Theis, J., Sanders, W., and Moog, H. (2022). Tangle 2.0 Leaderless Nakamoto Consensus on the Heaviest DAG. arXiv.","DOI":"10.1109\/ACCESS.2022.3211422"},{"key":"ref_22","unstructured":"(2018). Snowflake to Avalanche: A Novel Metastable Consensus Protocol Family for Cryptocurrencies Team Rocket. arXiv."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Antoniadis, K., Desjardins, A., Gramoli, V., Guerraoui, R., and Zablotchi, I. (2021, January 7\u201310). Leaderless Consensus. Proceedings of the 2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS), Washington, DC, USA.","DOI":"10.1109\/ICDCS51616.2021.00045"},{"key":"ref_24","unstructured":"Crain, T., Gramoli, V., Larrea, M., and Raynal, M. (2017). (Leader\/Randomization\/Signature)-free Byzantine Consensus for Consortium Blockchains. arXiv."},{"key":"ref_25","unstructured":"Antoniadis, K., Guerraoui, R., Malkhi, D., and Seredinschi, D.A. (2018, January 15\u201319). State Machine Replication Is More Expensive Than Consensus. Proceedings of the DISC, New Orleans, LA, USA."},{"key":"ref_26","unstructured":"Mills, D.L. (2010). Computer Network Time Synchronization: The Network Time Protocol on Earth and in Space, CRC Press, Inc.. [2nd ed.]."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Lamsh\u00f6ft, K., and Dittmann, J. (2022, January 27\u201328). Covert Channels in Network Time Security. Proceedings of the IH&MMSec \u201922: 2022 ACM Workshop on Information Hiding and Multimedia Security, Santa Barbara, CA, USA.","DOI":"10.1145\/3531536.3532947"},{"key":"ref_28","unstructured":"Menezes, A.J., Vanstone, S.A., and Oorschot, P.C.V. (1996). Handbook of Applied Cryptography, CRC Press, Inc.. [1st ed.]."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Antwi, R., Gadze, J.D., Tchao, E.T., Sikora, A., Nunoo-Mensah, H., Agbemenu, A.S., Obour Agyekum, K.O.B., Agyemang, J.O., Welte, D., and Keelson, E. (2022). A Survey on Network Optimization Techniques for Blockchain Systems. Algorithms, 15.","DOI":"10.3390\/a15060193"},{"key":"ref_30","unstructured":"Castro, M., and Liskov, B. (1999, January 22\u201325). Practical Byzantine Fault Tolerance. Proceedings of the OSDI \u201999: Third Symposium on Operating Systems Design and Implementation, New Orleans, LA, USA."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Yin, M., Malkhi, D., Reiter, M.K., Gueta, G.G., and Abraham, I. (August, January 29). HotStuff: BFT Consensus with Linearity and Responsiveness. Proceedings of the PODC \u201919: 2019 ACM Symposium on Principles of Distributed Computing, Toronto, ON, Canada.","DOI":"10.1145\/3293611.3331591"},{"key":"ref_32","unstructured":"Moniz, H. (2020). The Istanbul BFT Consensus Algorithm. arXiv."},{"key":"ref_33","unstructured":"Buchman, E., Kwon, J., and Milosevic, Z. (2018). The latest gossip on BFT consensus. arXiv."},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Crain, T., Gramoli, V., Larrea, M., and Raynal, M. (2018, January 1\u20133). DBFT: Efficient Leaderless Byzantine Consensus and its Application to Blockchains. Proceedings of the 2018 IEEE 17th International Symposium on Network Computing and Applications (NCA), Cambridge, MA, USA.","DOI":"10.1109\/NCA.2018.8548057"},{"key":"ref_35","unstructured":"Voron, G., and Gramoli, V. (2019). Dispel: Byzantine SMR with Distributed Pipelining. arXiv."},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Konnov, I.V., and Widder, J. (2018, January 5\u20139). ByMC: Byzantine Model Checker. Proceedings of the ISoLA, Limassol, Cyprus.","DOI":"10.1007\/978-3-030-03424-5_22"}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/16\/1\/38\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T18:02:47Z","timestamp":1760119367000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/16\/1\/38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,7]]},"references-count":36,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,1]]}},"alternative-id":["a16010038"],"URL":"https:\/\/doi.org\/10.3390\/a16010038","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2023,1,7]]}}}