BEST: A blockchain sharding scheme based on nodes performance for enhancing both security and effiency
preprint
OA: closed
CC-BY-4.0
Abstract
Abstract Sharding technology is seen as the most likely solution to the scalability of blockchain, by dividing nodes into smaller groups called shards that transactions can be processed in parallel. However, most sharding scheme adopted random sharding to avoid the aggregation of malicious nodes, while the performance difference between nodes is ignored, resulting in the transaction efficiency gap of each sharding. In this paper, we propose BEST, a blockchain sharding scheme with both security and effiency, nodes are allocated to a shard according to the reputation score, which guarantees the consistent comprehensive performance of each shard. A multi-attribute leader decision model is established instead of randomly selecting leader nodes. We verify the scheme through theoretical analysis and experimental evaluation, and the results show that the proposed scheme improves the parallel throughput of the system while ensuring system security.
My notes (saved in your browser only)
Citation neighborhood (no data yet)
We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.
Source provenance
- europepmc
- last seen: 2026-05-19T01:45:01.086888+00:00
- unpaywall
- last seen: 2026-05-28T02:00:01.590549+00:00
License: CC-BY-4.0