Cookies?
Library Header Image
LSE Research Online LSE Library Services

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: The 7th International Conference on Advances in Financial Technologies, 2025-10-07 - 2025-10-10, Carnegie Mellon University, Pittsburgh, United States, USA. (In Press)

Full text not available from this repository.

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: Conference or Workshop Item (Paper)
Additional Information: © 2025 The Author
Divisions: Mathematics
Subjects: Q Science > QA Mathematics
Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Date Deposited: 29 Aug 2025 09:33
Last Modified: 29 Aug 2025 09:37
URI: http://eprints.lse.ac.uk/id/eprint/129311

Actions (login required)

View Item View Item