Abstract
Sharding has been a highly expected solution for the blockchain scalability problem. But with computation power of honest miners (or stakes in PoS based systems) distributed in shards, it becomes easier for attackers to attack a single shard. In this research, we propose a new consensus algorithm, Greedy Observed Largest Forest (GOLF), aiming to consolidate distributed hash power in all shards to make attacking a single shard as hard as attacking the entire system.
Author supplied keywords
Cite
CITATION STYLE
Zhao, J., Yu, J., & Liu, J. K. (2020). Consolidating Hash Power in Blockchain Shards with a Forest. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12020 LNCS, pp. 309–322). Springer. https://doi.org/10.1007/978-3-030-42921-8_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
