SSChain: A full sharding protocol for public blockchain without data migration overhead
The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
Abstract Blockchain, known as distributed ledger technology, suffers from the scalability problem. A major approach to overcoming this limitation is using sharding, which divides the network into multiple smaller groups, called shards, these shards can work in parallel on disjoint transactions and maintain disjoint ledgers. Existing sharding-based protocols rely on reshuffling scheme to maintain security, however, since each shard only maintains a disjoint ledger, reshuffling the network will cause huge data migration. In this work, we propose SSChain, a novel non-reshuffling structure that supports both transaction sharding and state sharding. Our empirical evaluations suggest that SSChain can process more than 6,500 TPS in a network of 1,800 nodes without any data migration overhead.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Byzantine generals problem
Lamport, L., Shostak, R., & Pease, M. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357172.357176 · Cited by 6,023
Practical byzantine fault tolerance and proactive recovery
Castro, M., & Liskov, B. (2002) · ACM Transactions on Computer Systems · doi:10.1145/571637.571640 · Cited by 2,475
Algorand: Scaling Byzantine Agreements for Cryptocurrencies
Gilad, Y., Hemo, R., Micali, S., Vlachos, G., & Zeldovich, N. (2017) · Proceedings of the 26th Symposium on Operating Systems Principles · doi:10.1145/3132747.3132757 · Cited by 1,499
The Quest for Scalable Blockchain Fabric: Proof-of-Work vs. BFT Replication
Vukolić, M. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-39028-4_9 · Cited by 1,051
Can blockchain strengthen the internet of things?
Kshetri, N. (2017) · IT Professional · doi:10.1109/mitp.2017.3051335 · Cited by 918
Cited by
A survey on the adoption of blockchain in IoT: challenges and solutions
Uddin, M. A., Stranieri, A., Gondal, I., & Balasubramanian, V. (2021) · Blockchain: Research and Applications · doi:10.1016/j.bcra.2021.100006 · Cited by 365
Bhushan, B., Khamparia, A., Sagayam, K. M., Sharma, S. K., Ahad, M. A., & Debnath, N. C. (2020) · Sustainable Cities and Society · doi:10.1016/j.scs.2020.102360 · Cited by 353
Systematic Literature Review of Challenges in Blockchain Scalability
Khan, D., Jung, L. T., & Hashmani, M. A. (2021) · Applied Sciences · doi:10.3390/app11209372 · Cited by 338
Scaling Blockchains: A Comprehensive Survey
Hafid, A., Hafid, A. S., & Samih, M. (2020) · IEEE Access · doi:10.1109/access.2020.3007251 · Cited by 328
Blockchain-enabled supply chain: analysis, challenges, and future directions
Jabbar, S., Lloyd, H., Hammoudeh, M., Adebisi, B., & Raza, U. (2021) · Multimedia Systems · doi:10.1007/s00530-020-00687-0 · Cited by 307
Metadata
- Authors
- Chen, H., & Wang, Y.
- Venue
- Pervasive and Mobile Computing
- Publisher
- Elsevier BV
- Published
- 2019-10
- Volume
- 59
- Pages
- 101055
- ISSN
- 1574-1192 (ISSN-L)
- OpenAlex
- W2956869838
- Cited by
- 90
- References
- 5
- FWCI
- 11.87
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.