2026-07-22T00:06:54Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:24737 2026-01-21T09:56:17Z ddc:004 open_access

From Permissioned to Proof-of-Stake Consensus Komatovic, Jovan Lewis-Pye, Andrew Neu, Joachim Roughgarden, Tim Tas, Ertem Nusret Permissioned Consensus Proof-of-Stake generic Compiler Blockchain 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Jovan Komatovic and Andrew Lewis-Pye and Joachim Neu and Tim Roughgarden and Ertem Nusret Tas 2025 Is Part Of LIPIcs, Volume 354, 7th Conference on Advances in Financial Technologies (AFT 2025) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.AFT.2025.18 urn:nbn:de:0030-drops-247373 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AFT.2025.18 eng https://creativecommons.org/licenses/by/4.0/legalcode