The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
OptChain: Optimal Transactions Placement for Scalable Blockchain Sharding
Open accessAbstract
A major challenge in blockchain sharding protocols is that more than 95% transactions are cross-shard. Not only those cross-shard transactions degrade the system throughput but also double the confirmation time, and exhaust an already scarce network bandwidth. Are cross-shard transactions imminent for sharding schemes? In this paper, we propose a new sharding paradigm, called OptChain, in which cross-shard transactions are minimized, resulting in almost twice faster confirmation time and throughput. By treating transactions as a stream of nodes in an online graph, OptChain utilizes a lightweight and on-the-fly transaction placement method to group both related and soon-related transactions into the same shards. At the same time, OptChain maintains a temporal balance among shards to guarantee the high parallelism. Our comprehensive and large-scale simulation using Oversim P2P library confirms a significant boost in performance with up to 10 folds reduction in cross-shard transactions, more than twice reduction in confirmation time, and 50% increase in throughput. When combined with Omniledger sharding protocol, OptChain delivers a 6000 transactions per second throughput with 10.5s confirmation time.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Blockchains and smart contracts for the internet of things
Christidis, K., & Devetsikiotis, M. (2016) · IEEE Access · doi:10.1109/access.2016.2566339 · Cited by 4,552
MedRec: Using Blockchain for Medical Data Access and Permission Management
Azaria, A., Ekblaw, A., Vieira, T., & Lippman, A. (2016) · 2016 2nd International Conference on Open and Big Data (OBD) · doi:10.1109/obd.2016.11 · Cited by 2,526
Yue, X., Wang, H., Jin, D., Li, M., & Jiang, W. (2016) · Journal of Medical Systems · doi:10.1007/s10916-016-0574-6 · Cited by 1,240
Misbehavior in Bitcoin: A Study of Double-Spending and Accountability
Karame, G. O., Androulaki, E., Roeschlin, M., Gervais, A., & Čapkun, S. (2015) · ACM Transactions on Information and System Security · doi:10.1145/2732196 · Cited by 186
Cited by
A Survey of Blockchain Consensus Protocols
Xu, J., Wang, C., & Jia, X. (2023) · ACM Computing Surveys · doi:10.1145/3579845 · Cited by 263
Metadata
- Authors
- Nguyen, L. N., Nguyen, T. D. T., Dinh, T. N., & Thai, M. T.
- Venue
- 2019 IEEE 39th International Conference on Distributed Computing Systems (ICDCS)
- Publisher
- IEEE
- Published
- 2019-07
- Pages
- 525-535
- OpenAlex
- W2982468232
- Cited by
- 166
- References
- 4
- FWCI
- 10.36
- Type
- conference paper
- Language
- en
- Open access
- green
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: OptChain: Optimal Transactions Placement for Scalable Blockchain Sharding. https://app.cochat.ai/papers/10.1109/icdcs.2019.00059
- The paper
- Nguyen, L. N., Nguyen, T. D. T., Dinh, T. N., & Thai, M. T. (2019). OptChain: Optimal Transactions Placement for Scalable Blockchain Sharding. 2019 IEEE 39th International Conference on Distributed Computing Systems (ICDCS). https://doi.org/10.1109/icdcs.2019.00059
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.