1 research outputs found
Proof-of-Stake Blockchain Protocols with Near-Optimal Throughput
One of the most significant challenges in the design of blockchain
protocols is increasing their transaction-processing throughput.
In this work we put forth for the first time a formal execution
model that enables to express transaction throughput while supporting
formal security arguments regarding persistence and liveness.
We then present a protocol in the proof-of-stake setting
achieving near-optimal throughput under adaptive active corruption of
any minority of the stake