No chain selection rule can secure a proof-of-space longest-chain blockchain when honest space varies over time: the attacker wins with a fork of length about phi squared times rho divided by epsilon, and this is tight up to a factor phi.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CR 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
On the (in)security of Proofs-of-Space based Longest-Chain Blockchains
No chain selection rule can secure a proof-of-space longest-chain blockchain when honest space varies over time: the attacker wins with a fork of length about phi squared times rho divided by epsilon, and this is tight up to a factor phi.