Blockchain in dynamic networks
From MaRDI portal
Abstract: We consider blockchain in dynamic networks. We define the Blockchain Decision Problem. It requires miners that maintain the blockchain to confirm whether a particular block is accepted. We establish the necessary conditions for the existence of a solution. We, however, prove that the solution, even under these necessary conditions is, in general, impossible. We then present two algorithms that solve the Blockchain Decision Problem under either the knowledge of the maximum source pool propagation time or the knowledge of the source pool membership. We evaluate the performance of the two algorithms.
Recommendations
Cites work
- A characterization of oblivious message adversaries for which consensus is solvable
- Consensus in rooted dynamic networks with short-lived stability
- Coordinated consensus in dynamic networks
- Distributed computation in dynamic networks
- Mediated population protocols
- Reliable broadcast in dynamic networks with locally bounded Byzantine failures
- The Byzantine Generals Problem
- The Heard-Of model: computing in distributed systems with benign faults
- Time is not a healer (preliminary version)
Cited in
(6)
This page was built for publication: Blockchain in dynamic networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6155240)