Paper 2025/1139 Original: eprint.iacr.org/2025/1139 ↗
From Permissioned to Proof-of-Stake Consensus
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.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2025-08-10: last updated
- 2025-06-17: published
- Short URL
- https://ia.cr/2025/1139
- License
- https://creativecommons.org/licenses/by-nc-nd/4.0/
BibTeX
@misc{cryptoeprint:2025/1139,
author = {Jovan Komatovic and Andrew Lewis-Pye and Joachim Neu and Tim Roughgarden and Ertem Nusret Tas},
title = {From Permissioned to Proof-of-Stake Consensus},
howpublished = {Cryptology {ePrint} Archive, Paper 2025/1139},
year = {2025},
url = {https://eprint.iacr.org/2025/1139}
}