From permissioned to proof-of-stake consensus

Komatovic, Jovan, Lewis-Pye, Andrew, Neu, Joachim, Roughgarden, Tim and Nusret Tas, Ertem (2025) From permissioned to proof-of-stake consensus. In: Avarikioti, Zeta and Christin, Nicolas, (eds.) 7th Conference on Advances in Financial Technologies (AFT 2025). Leibniz International Proceedings in Informatics, LIPIcs (354). Schloss Dagstuhl, Leibniz-Zentrum für Informatik. ISBN 9783959774000

Text (LIPIcs.AFT.2025.18) - Published Version Available under License Creative Commons Attribution. Download (1MB)

• Scopus publication

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.

Item Type:	Book Section
Additional Information:	© Jovan Komatovic, Andrew Lewis-Pye, Joachim Neu, Tim Roughgarden, and Ertem Nusret Tas;
Divisions:	Mathematics
Subjects:	Q Science > QA Mathematics Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Date Deposited:	29 Aug 2025 23:02
Last Modified:	25 Nov 2025 20:57
URI:	http://eprints.lse.ac.uk/id/eprint/129319

Actions (login required)

View Item