Alert suppression in blockchain systems can be made quadratically expensive (Θ(n²) in the number of alerters), and the paper gives constant-time and sequential protocols that achieve this bound.
arXiv preprint arXiv:2402.08908 (2024)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CR 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Resilient Alerting Protocols for Blockchains
Alert suppression in blockchain systems can be made quadratically expensive (Θ(n²) in the number of alerters), and the paper gives constant-time and sequential protocols that achieve this bound.