SecPoS: Slashable Proof-of-Stake Consensus with Low Transaction Delays and Checkpoint Costs

Abstract

Nowadays, checkpoints have been proven to be an effective solution to ensure slashability in proof-of-stake (PoS) consensus, and Tas et al.'s cutting-edge solution in S&P 2023 is a typical example. Unfortunately, despite progress, hour-level transaction delays and annually around 10 K dollar checkpoint costs make existing related solutions still unacceptable in realworld PoS applications. In this paper, we propose SecPoS, a slashable PoS consensus with second-level transaction delays and one-time checkpoint costs. To achieve these design goals, we draw inspiration from Pixel+ signatures and chameleon hash functions to design a novel bilateral blockchain structure, achieving twoblock transaction finalization via only uploading the first block of our chain as checkpoints. Next, considering practical application requirements, we address a series of following challenges, such as bilateral immutability, blockchain forks, determination of the main chain, and malicious attacks from PoS members. In detail, we propose two constructions of SecPoS, i.e., SecPoS – A and SecPoS – B. SecPoS – A and SecPoS – B have a tradeoff between transaction delays and block numbers packed in an epoch. Compatible with most existing one-way blockchains, we implement and outsource a prototype SecPoS to facilitate research11https://github.com/Academic-Paper-Codes/SecPoS-Consensus, and prove the security of SecPoS. Experiments on this prototype show that SecPoS – A and SecPoS – B require around 5s and 100s transaction delays, respectively, and both require 2 dollars one-time checkpoint costs.