Document Open Access Logo

From Permissioned to Proof-of-Stake Consensus

Authors Jovan Komatovic , Andrew Lewis-Pye , Joachim Neu , Tim Roughgarden , Ertem Nusret Tas

PDF

File

Thumbnail PDF
PDF
LIPIcs.AFT.2025.18.pdf
  • Filesize: 1.1 MB
  • 26 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Distributed algorithms
  • Security and privacy → Distributed systems security
Keywords
  • Permissioned Consensus
  • Proof-of-Stake
  • generic Compiler
  • Blockchain

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

This paper presents the first generic compiler that transforms any permissioned consensus protocol into a proof-of-stake permissionless consensus protocol. For each of the following properties, if the initial permissioned protocol satisfies that property in the partially synchronous setting, the consequent proof-of-stake protocol also satisfies that property in the partially synchronous and quasi-permissionless setting (with the same fault-tolerance): consistency; liveness; optimistic responsiveness; every composable log-specific property; and message complexity of a given order. Moreover, our transformation ensures that the output protocol satisfies accountability (identifying culprits in the event of a consistency violation), whether or not the original permissioned protocol satisfied it.

Cite As Get BibTex

Jovan Komatovic, Andrew Lewis-Pye, Joachim Neu, Tim Roughgarden, and Ertem Nusret Tas. From Permissioned to Proof-of-Stake Consensus. In 7th Conference on Advances in Financial Technologies (AFT 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 354, pp. 18:1-18:26, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.AFT.2025.18

Author Details

Jovan Komatovic
  • École Polytechnique Fédérale de Lausanne (EPFL), Switzerland
Andrew Lewis-Pye
  • London School of Economics (LSE), UK
Joachim Neu
  • a16z Crypto Research, New York, NY, USA
Tim Roughgarden
  • Columbia University, New York, NY, USA
  • a16z Crypto Research, New York, NY, USA
Ertem Nusret Tas
  • Stanford University, CA, USA

Funding

The work of JK and ENT was conducted in part while at a16z Crypto Research. The research of TR at Columbia University was supported in part by NSF awards CCF-2006737 and CNS-2212745. ENT was further supported by the Stanford Center for Blockchain Research and a Research Hub Collaboration agreement between Stanford University and Input Output Global Inc.

References

  1. Ittai Abraham and Dahlia Malkhi. BVP: Byzantine vertical Paxos. In Distributed Cryptocurrencies and Consensus Ledgers (DCCL), 2016. Google Scholar
  2. Marcos Kawazoe Aguilera, Idit Keidar, Dahlia Malkhi, and Alexander Shraer. Dynamic atomic storage without consensus. J. ACM, 58(2):7:1-7:32, 2011. URL: https://doi.org/10.1145/1944345.1944348.
  3. Eduardo Alchieri, Alysson Bessani, Fabíola Greve, and Joni da Silva Fraga. Efficient and modular consensus-free reconfiguration for fault-tolerant storage. In OPODIS, volume 95 of LIPIcs, pages 26:1-26:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. URL: https://doi.org/10.4230/LIPICS.OPODIS.2017.26.
  4. Bowen Alpern and Fred B. Schneider. Defining liveness. Inf. Process. Lett., 21(4):181-185, 1985. URL: https://doi.org/10.1016/0020-0190(85)90056-0.
  5. Bowen Alpern and Fred B. Schneider. Recognizing safety and liveness. Distributed Comput., 2(3):117-126, 1987. URL: https://doi.org/10.1007/BF01782772.
  6. Yair Amir, Cristina Nita-Rotaru, Jonathan Robert Stanton, and Gene Tsudik. Secure Spread: An integrated architecture for secure group communication. IEEE Trans. Dependable Secur. Comput., 2(3):248-261, 2005. URL: https://doi.org/10.1109/TDSC.2005.39.
  7. Yair Amir and Jonathan Stanton. The Spread wide area group communication system. Technical Report CNDS-98-4, The Center for Networking and Distributed Systems, The Johns Hopkins University, 1998. Google Scholar
  8. Balaji Arun, Zekun Li, Florian Suri-Payer, Sourav Das, and Alexander Spiegelman. Shoal++: High throughput DAG BFT can be fast and robust! In NSDI, pages 813-826. USENIX Association, 2025. URL: https://www.usenix.org/conference/nsdi25/presentation/arun.
  9. Kushal Babel, Andrey Chursin, George Danezis, Anastasios Kichidis, Lefteris Kokoris-Kogias, Arun Koshy, Alberto Sonnino, and Mingwei Tian. Mysticeti: Reaching the limits of latency with uncertified dags. arXiv:2310.14821v4 [cs.DC], 2023. URL: https://arxiv.org/abs/2310.14821v4.
  10. Mathieu Baudet, George Danezis, and Alberto Sonnino. Fastpay: High-performance byzantine fault tolerant settlement. In AFT, pages 163-177. ACM, 2020. URL: https://doi.org/10.1145/3419614.3423249.
  11. Fabrice Benhamouda, Craig Gentry, Sergey Gorbunov, Shai Halevi, Hugo Krawczyk, Chengyu Lin, Tal Rabin, and Leonid Reyzin. Can a public blockchain keep a secret? In TCC (1), volume 12550 of Lecture Notes in Computer Science, pages 260-290. Springer, 2020. URL: https://doi.org/10.1007/978-3-030-64375-1_10.
  12. Iddo Bentov, Ariel Gabizon, and Alex Mizrahi. Cryptocurrencies without proof of work. arXiv:1406.5694v9 [cs.CR], 2014. URL: https://arxiv.org/abs/1406.5694v9.
  13. Iddo Bentov, Charles Lee, Alex Mizrahi, and Meni Rosenfeld. Proof of activity: Extending Bitcoin’s proof of work via proof of stake [extended abstract]. SIGMETRICS Perform. Evaluation Rev., 42(3):34-37, 2014. URL: https://doi.org/10.1145/2695533.2695545.
  14. Alysson Neves Bessani, João Sousa, and Eduardo Adílio Pelinson Alchieri. State machine replication for the masses with BFT-SMART. In DSN, pages 355-362. IEEE Computer Society, 2014. URL: https://doi.org/10.1109/DSN.2014.43.
  15. Kenneth P. Birman and Thomas A. Joseph. Reliable communication in the presence of failures. ACM Trans. Comput. Syst., 5(1):47-76, 1987. URL: https://doi.org/10.1145/7351.7478.
  16. Sam Blackshear, Andrey Chursin, George Danezis, Anastasios Kichidis, Lefteris Kokoris-Kogias, Xun Li, Mark Logan, Ashok Menon, Todd Nowacki, Alberto Sonnino, Brandon Williams, and Lu Zhang. Sui lutris: A blockchain combining broadcast and consensus. In CCS, pages 2606-2620. ACM, 2024. URL: https://doi.org/10.1145/3658644.3670286.
  17. Gabriel Bracha. An asynchronous [(n-1)/3]-resilient consensus protocol. In PODC, pages 154-162. ACM, 1984. URL: https://doi.org/10.1145/800222.806743.
  18. Ethan Buchman, Jae Kwon, and Zarko Milosevic. The latest gossip on BFT consensus. arXiv:1807.04938v3 [cs.DC], 2018. URL: https://arxiv.org/abs/1807.04938v3.
  19. Eric Budish, Andrew Lewis-Pye, and Tim Roughgarden. The economic limits of permissionless consensus. In EC, pages 704-731. ACM, 2024. URL: https://doi.org/10.1145/3670865.3673548.
  20. Vitalik Buterin and Virgil Griffith. Casper the friendly finality gadget. arXiv:1710.09437v4 [cs.CR], 2017. URL: https://arxiv.org/abs/1710.09437v4.
  21. Vitalik Buterin, Diego Hernandez, Thor Kamphefner, Khiem Pham, Zhi Qiao, Danny Ryan, Juhyeok Sin, Ying Wang, and Yan X Zhang. Combining ghost and casper. arXiv:2003.03052v3 [cs.CR], 2020. URL: https://arxiv.org/abs/2003.03052v3.
  22. Christian Cachin, Rachid Guerraoui, and Luís E. T. Rodrigues. Introduction to Reliable and Secure Distributed Programming (2. ed.). Springer, 2011. URL: https://doi.org/10.1007/978-3-642-15260-3.
  23. Christian Cachin, Klaus Kursawe, Frank Petzold, and Victor Shoup. Secure and efficient asynchronous broadcast protocols. In CRYPTO, volume 2139 of Lecture Notes in Computer Science, pages 524-541. Springer, 2001. URL: https://doi.org/10.1007/3-540-44647-8_31.
  24. Martina Camaioni, Rachid Guerraoui, Jovan Komatovic, Matteo Monti, Pierre-Louis Roman, Manuel Vidigueira, and Gauthier Voron. Carbon: Scaling trusted payments with untrusted machines. IEEE Trans. Dependable Secur. Comput., 22(2):1168-1180, 2025. URL: https://doi.org/10.1109/TDSC.2024.3428617.
  25. Miguel Castro and Barbara Liskov. Practical byzantine fault tolerance and proactive recovery. ACM Trans. Comput. Syst., 20(4):398-461, 2002. URL: https://doi.org/10.1145/571637.571640.
  26. T-H. Hubert Chan, Rafael Pass, and Elaine Shi. PaLa: A simple partially synchronous blockchain. Cryptology ePrint Archive, Paper 2018/981, 2018. URL: https://eprint.iacr.org/2018/981.
  27. Jing Chen and Silvio Micali. Algorand: A secure and efficient distributed ledger. Theor. Comput. Sci., 777:155-183, 2019. URL: https://doi.org/10.1016/J.TCS.2019.02.001.
  28. Gregory V. Chockler, Idit Keidar, and Roman Vitenberg. Group communication specifications: a comprehensive study. ACM Comput. Surv., 33(4):427-469, 2001. URL: https://doi.org/10.1145/503112.503113.
  29. Pierre Civit, Muhammad Ayaz Dzulfikar, Seth Gilbert, Vincent Gramoli, Rachid Guerraoui, Jovan Komatovic, and Manuel Vidigueira. Byzantine consensus is Θ(n²): the Dolev-Reischuk bound is tight even in partial synchrony! Distributed Comput., 37(2):89-119, 2024. URL: https://doi.org/10.1007/S00446-023-00458-W.
  30. Pierre Civit, Seth Gilbert, and Vincent Gramoli. Polygraph: Accountable byzantine agreement. In ICDCS, pages 403-413. IEEE, 2021. URL: https://doi.org/10.1109/ICDCS51616.2021.00046.
  31. Pierre Civit, Seth Gilbert, Vincent Gramoli, Rachid Guerraoui, and Jovan Komatovic. As easy as ABC: optimal (a)ccountable (b)yzantine (c)onsensus is easy! J. Parallel Distributed Comput., 181:104743, 2023. URL: https://doi.org/10.1016/J.JPDC.2023.104743.
  32. Pierre Civit, Seth Gilbert, Vincent Gramoli, Rachid Guerraoui, Jovan Komatovic, Zarko Milosevic, and Adi Seredinschi. Crime and punishment in distributed byzantine decision tasks. In ICDCS, pages 34-44. IEEE, 2022. URL: https://doi.org/10.1109/ICDCS54860.2022.00013.
  33. Phil Daian, Rafael Pass, and Elaine Shi. Snow White: Robustly reconfigurable consensus and applications to provably secure proof of stake. In Financial Cryptography, volume 11598 of Lecture Notes in Computer Science, pages 23-41. Springer, 2019. URL: https://doi.org/10.1007/978-3-030-32101-7_2.
  34. George Danezis, Lefteris Kokoris-Kogias, Alberto Sonnino, and Alexander Spiegelman. Narwhal and Tusk: a DAG-based mempool and efficient BFT consensus. In EuroSys, pages 34-50. ACM, 2022. URL: https://doi.org/10.1145/3492321.3519594.
  35. Bernardo David, Peter Gazi, Aggelos Kiayias, and Alexander Russell. Ouroboros Praos: An adaptively-secure, semi-synchronous proof-of-stake blockchain. In EUROCRYPT (2), volume 10821 of Lecture Notes in Computer Science, pages 66-98. Springer, 2018. URL: https://doi.org/10.1007/978-3-319-78375-8_3.
  36. Evangelos Deirmentzoglou, Georgios Papakyriakopoulos, and Constantinos Patsakis. A survey on long-range attacks for proof of stake protocols. IEEE Access, 7:28712-28725, 2019. URL: https://doi.org/10.1109/ACCESS.2019.2901858.
  37. Danny Dolev and Rüdiger Reischuk. Bounds on information exchange for byzantine agreement. J. ACM, 32(1):191-204, 1985. URL: https://doi.org/10.1145/2455.214112.
  38. Danny Dolev and H. Raymond Strong. Authenticated algorithms for byzantine agreement. SIAM J. Comput., 12(4):656-666, 1983. URL: https://doi.org/10.1137/0212045.
  39. Sisi Duan, Hein Meling, Sean Peisert, and Haibin Zhang. Bchain: Byzantine replication with high throughput and embedded reconfiguration. In OPODIS, volume 8878 of Lecture Notes in Computer Science, pages 91-106. Springer, 2014. URL: https://doi.org/10.1007/978-3-319-14472-6_7.
  40. Sisi Duan and Haibin Zhang. Foundations of dynamic BFT. In SP, pages 1317-1334. IEEE, 2022. URL: https://doi.org/10.1109/SP46214.2022.9833787.
  41. Cynthia Dwork, Nancy A. Lynch, and Larry J. Stockmeyer. Consensus in the presence of partial synchrony. J. ACM, 35(2):288-323, 1988. URL: https://doi.org/10.1145/42282.42283.
  42. Ethereum Foundation. Ethereum consensus specifications. https://github.com/ethereum/consensus-specs, 2023. Accessed: 2023-12-14.
  43. Michael J. Fischer, Nancy A. Lynch, and Mike Paterson. Impossibility of distributed consensus with one faulty process. J. ACM, 32(2):374-382, 1985. URL: https://doi.org/10.1145/3149.214121.
  44. Eli Gafni and Dahlia Malkhi. Elastic configuration maintenance via a parsimonious speculating snapshot solution. In DISC, volume 9363 of Lecture Notes in Computer Science, pages 140-153. Springer, 2015. URL: https://doi.org/10.1007/978-3-662-48653-5_10.
  45. Vipul Goyal, Abhiram Kothapalli, Elisaweta Masserova, Bryan Parno, and Yifan Song. Storing and retrieving secrets on a blockchain. In Public Key Cryptography (1), volume 13177 of Lecture Notes in Computer Science, pages 252-282. Springer, 2022. URL: https://doi.org/10.1007/978-3-030-97121-2_10.
  46. Rachid Guerraoui, Jovan Komatovic, Petr Kuznetsov, Yvonne-Anne Pignolet, Dragos-Adrian Seredinschi, and Andrei Tonkikh. Dynamic byzantine reliable broadcast. In OPODIS, volume 184 of LIPIcs, pages 23:1-23:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. URL: https://doi.org/10.4230/LIPICS.OPODIS.2020.23.
  47. Rachid Guerraoui, Petr Kuznetsov, Matteo Monti, Matej Pavlovic, and Dragos-Adrian Seredinschi. The consensus number of a cryptocurrency. Distributed Comput., 35(1):1-15, 2022. URL: https://doi.org/10.1007/S00446-021-00399-2.
  48. Andreas Haeberlen, Petr Kouznetsov, and Peter Druschel. Peerreview: practical accountability for distributed systems. In SOSP, pages 175-188. ACM, 2007. URL: https://doi.org/10.1145/1294261.1294279.
  49. Leander Jehl, Roman Vitenberg, and Hein Meling. Smartmerge: A new approach to reconfiguration for atomic storage. In DISC, volume 9363 of Lecture Notes in Computer Science, pages 154-169. Springer, 2015. URL: https://doi.org/10.1007/978-3-662-48653-5_11.
  50. Idit Keidar, Eleftherios Kokoris-Kogias, Oded Naor, and Alexander Spiegelman. All you need is DAG. In PODC, pages 165-175. ACM, 2021. URL: https://doi.org/10.1145/3465084.3467905.
  51. Aggelos Kiayias, Alexander Russell, Bernardo David, and Roman Oliynykov. Ouroboros: A provably secure proof-of-stake blockchain protocol. In CRYPTO (1), volume 10401 of Lecture Notes in Computer Science, pages 357-388. Springer, 2017. URL: https://doi.org/10.1007/978-3-319-63688-7_12.
  52. Sunny King and Scott Nadal. PPCoin: Peer-to-peer crypto-currency with proof-of-stake. https://peercoin.net/assets/paper/peercoin-paper.pdf, 2012.
  53. Eleftherios Kokoris-Kogias, Philipp Jovanovic, Nicolas Gailly, Ismail Khoffi, Linus Gasser, and Bryan Ford. Enhancing bitcoin security and performance with strong consistency via collective signing. In USENIX Security Symposium, pages 279-296. USENIX Association, 2016. URL: https://www.usenix.org/conference/usenixsecurity16/technical-sessions/presentation/kogias.
  54. Jovan Komatovic, Andrew Lewis-Pye, Joachim Neu, Tim Roughgarden, and Ertem Nusret Tas. From permissioned to proof-of-stake consensus. Cryptology ePrint Archive, Paper 2025/1139, 2025. URL: https://eprint.iacr.org/2025/1139.
  55. Petr Kuznetsov, Thibault Rieutord, and Sara Tucci Piergiovanni. Reconfigurable lattice agreement and applications. In OPODIS, volume 153 of LIPIcs, pages 31:1-31:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. URL: https://doi.org/10.4230/LIPICS.OPODIS.2019.31.
  56. Petr Kuznetsov and Andrei Tonkikh. Asynchronous reconfiguration with byzantine failures. Distributed Comput., 35(6):477-502, 2022. URL: https://doi.org/10.1007/S00446-022-00421-1.
  57. Leslie Lamport. The part-time parliament. ACM Trans. Comput. Syst., 16(2):133-169, 1998. URL: https://doi.org/10.1145/279227.279229.
  58. Leslie Lamport, Dahlia Malkhi, and Lidong Zhou. Stoppable Paxos. Unpublished manuscript, https://lamport.azurewebsites.net/pubs/stoppable.pdf, 2009.
  59. Leslie Lamport, Dahlia Malkhi, and Lidong Zhou. Vertical Paxos and primary-backup replication. In PODC, pages 312-313. ACM, 2009. URL: https://doi.org/10.1145/1582716.1582783.
  60. Leslie Lamport, Dahlia Malkhi, and Lidong Zhou. Reconfiguring a state machine. SIGACT News, 41(1):63-73, 2010. URL: https://doi.org/10.1145/1753171.1753191.
  61. Andrew Lewis-Pye. Quadratic worst-case message complexity for state machine replication in the partial synchrony model. arXiv:2201.01107v1 [cs.DC], 2022. URL: https://arxiv.org/abs/2201.01107v1.
  62. Andrew Lewis-Pye and Tim Roughgarden. Permissionless consensus. arXiv:2304.14701v5 [cs.DC], 2023. URL: https://arxiv.org/abs/2304.14701v5.
  63. Andrew Lewis-Pye and Tim Roughgarden. Beyond optimal fault tolerance. arXiv:2501.06044v7 [cs.DC], 2025. URL: https://arxiv.org/abs/2501.06044v7.
  64. Sai Krishna Deepak Maram, Fan Zhang, Lun Wang, Andrew Low, Yupeng Zhang, Ari Juels, and Dawn Song. CHURP: dynamic-committee proactive secret sharing. In CCS, pages 2369-2386. ACM, 2019. URL: https://doi.org/10.1145/3319535.3363203.
  65. Gregory Maxwell and Andrew Poelstra. Distributed consensus from proof of stake is impossible. https://download.wpsoftware.net/bitcoin/pos.pdf, 2014.
  66. Andrew Miller, Yu Xia, Kyle Croman, Elaine Shi, and Dawn Song. The honey badger of BFT protocols. In CCS, pages 31-42. ACM, 2016. URL: https://doi.org/10.1145/2976749.2978399.
  67. Louise E. Moser, Yair Amir, P. M. Melliar-Smith, and Deborah A. Agarwal. Extended virtual synchrony. In ICDCS, pages 56-65. IEEE Computer Society, 1994. URL: https://doi.org/10.1109/ICDCS.1994.302392.
  68. Satoshi Nakamoto. Bitcoin: A peer-to-peer electronic cash system. https://bitcoin.org/bitcoin.pdf, 2008.
  69. Joachim Neu, Ertem Nusret Tas, and David Tse. Ebb-and-flow protocols: A resolution of the availability-finality dilemma. In SP, pages 446-465. IEEE, 2021. URL: https://doi.org/10.1109/SP40001.2021.00045.
  70. Joachim Neu, Ertem Nusret Tas, and David Tse. The availability-accountability dilemma and its resolution via accountability gadgets. In Financial Cryptography, volume 13411 of Lecture Notes in Computer Science, pages 541-559. Springer, 2022. URL: https://doi.org/10.1007/978-3-031-18283-9_27.
  71. Joachim Neu, Ertem Nusret Tas, and David Tse. Short paper: Accountable safety implies finality. In FC (1), volume 14744 of Lecture Notes in Computer Science, pages 41-50. Springer, 2024. URL: https://doi.org/10.1007/978-3-031-78676-1_3.
  72. Diego Ongaro and John K. Ousterhout. In search of an understandable consensus algorithm. In USENIX ATC, pages 305-319. USENIX Association, 2014. URL: https://www.usenix.org/conference/atc14/technical-sessions/presentation/ongaro.
  73. Rafael Pass and Elaine Shi. Hybrid consensus: Efficient consensus in the permissionless model. In DISC, volume 91 of LIPIcs, pages 39:1-39:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. URL: https://doi.org/10.4230/LIPICS.DISC.2017.39.
  74. Rafael Pass and Elaine Shi. The sleepy model of consensus. In ASIACRYPT (2), volume 10625 of Lecture Notes in Computer Science, pages 380-409. Springer, 2017. URL: https://doi.org/10.1007/978-3-319-70697-9_14.
  75. André Schiper and Alain Sandoz. Uniform reliable multicast in a virtually synchronous environment. In ICDCS, pages 561-568. IEEE Computer Society, 1993. URL: https://doi.org/10.1109/ICDCS.1993.287667.
  76. Peiyao Sheng, Gerui Wang, Kartik Nayak, Sreeram Kannan, and Pramod Viswanath. BFT protocol forensics. In CCS, pages 1722-1743. ACM, 2021. URL: https://doi.org/10.1145/3460120.3484566.
  77. Jakub Sliwinski and Roger Wattenhofer. Abc: Proof-of-stake without consensus. arXiv:1909.10926v3 [cs.CR], 2019. URL: https://arxiv.org/abs/1909.10926v3.
  78. Alexander Spiegelman, Balaji Arun, Rati Gelashvili, and Zekun Li. Shoal: Improving DAG-BFT latency and robustness. In FC (1), volume 14744 of Lecture Notes in Computer Science, pages 92-109. Springer, 2024. URL: https://doi.org/10.1007/978-3-031-78676-1_6.
  79. Alexander Spiegelman, Neil Giridharan, Alberto Sonnino, and Lefteris Kokoris-Kogias. Bullshark: DAG BFT protocols made practical. In CCS, pages 2705-2718. ACM, 2022. URL: https://doi.org/10.1145/3548606.3559361.
  80. Alexander Spiegelman, Idit Keidar, and Dahlia Malkhi. Dynamic reconfiguration: Abstraction and optimal asynchronous solution. In DISC, volume 91 of LIPIcs, pages 40:1-40:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. URL: https://doi.org/10.4230/LIPICS.DISC.2017.40.
  81. User cunicula and M. Rosenfeld. Proof of stake brainstorming. https://bitcointalk.org/index.php?topic=37194.0, 2011.
  82. User QuantumMechanic. Proof of stake instead of proof of work. https://bitcointalk.org/index.php?topic=27787.0, 2011.
  83. User tacotime. Netcoin proof-of-work and proof-of-stake hybrid design. https://web.archive.org/web/20131213085759/http://www.netcoin.io/wiki/Netcoin_Proof-of-Work_and_Proof-of-Stake_Hybrid_Design, 2013.
  84. Maofan Yin, Dahlia Malkhi, Michael K. Reiter, Guy Golan-Gueta, and Ittai Abraham. HotStuff: BFT consensus with linearity and responsiveness. In PODC, pages 347-356. ACM, 2019. URL: https://doi.org/10.1145/3293611.3331591.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact