The DOI matches its Crossref record; 57 of the 60 references it cites were found in a registry or an index.
The Quest for Scalable Blockchain Fabric: Proof-of-Work vs. BFT Replication
Open accessAbstract
Bitcoin cryptocurrency demonstrated the utility of global consensus across thousands of nodes, changing the world of digital transactions forever. In the early days of Bitcoin, the performance of its probabilistic proof-of-work (PoW) based consensus fabric, also known as blockchain, was not a major issue. Bitcoin became a success story, despite its consensus latencies on the order of an hour and the theoretical peak throughput of only up to 7 transactions per second.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“In BigchainDB, PBFT is referred as tendermint protocol [126] where the nodes having stake (similar to PoS) are selected as the backup nodes.”
From A Review of Blockchain Architecture and Consensus Protocols: Use Cases, Challenges, and Solutions (2019) · cites this paper as [126]
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 · cited 1×
“A family of state-machine replication protocols particularly interesting for blockchain is the family of Byzantine fault-tolerant (BFT) [38] state-machine replication protocols, which promise consensus despite participation of malicious (Byzantine) nodes.”
(2013) · Cited by 5,372
Impossibility of distributed consensus with one faulty process
Fischer, M. J., Lynch, N. A., & Paterson, M. S. (1985) · Journal of the ACM · doi:10.1145/3149.214121 · Cited by 4,579 · cited 2×
“…to standard, eventually synchronous [21] BFT protocols such as PBFT. Specifically, randomized BFT protocols circumvent the FLP consensus impossibility result [25] by guaranteeing correctness with very high probability (i.e., always, except with negligible probability), rather than deterministically.”
Douceur, J. R. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45748-8_24 · Cited by 4,419 · cited 1×
“Such public blockchains are sometimes also called “permissionless” blockchains — permissionless participation is made possible by PoW, as PoW inherently addresses the Sybil attack [18], infamous in anonymous networks.”
In search of an understandable consensus algorithm
Ongaro, D., & Ousterhout, J. K. (2014) · USENIX Annual Technical Conference · Cited by 3,398
Lamport, L. (1998) · ACM Transactions on Computer Systems · doi:10.1145/279227.279229 · Cited by 2,737 · cited 2×
“However, even optimistic BFT have a resource and communication overhead when compared to crash-tolerant replication protocols (e.g., [37, 31, 50]), which are better proven in practice and may serve as a baseline for BFT.”
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 · cited 4×
“Intuitively, because of their intensive network communication which often involves as many as O ( n 2 ) messages per block [10], BFT protocols are seen in the database and systems communities as not scalable (see also [45]).”
InfluentialImplementing fault-tolerant services using the state machine approach: a tutorial
Schneider, F. B. (1990) · ACM Computing Surveys · doi:10.1145/98163.98167 · Cited by 2,387 · cited 1×
“Smart-contract use cases take the blockchain well beyond its original cryp-tocurrency purpose, back to the domain of database replication protocols, notably, the classical state-machine replication [54].”
Consensus in the presence of partial synchrony
Dwork, C., Lynch, N., & Stockmeyer, L. (1988) · Journal of the ACM · doi:10.1145/42282.42283 · Cited by 1,909 · cited 2×
“The safety properties of consensus, including consensus finality, are maintained despite global communication outages and arbitrarily long asynchrony periods [20].”
Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services
Gilbert, S., & Lynch, N. (2002) · ACM SIGACT News · doi:10.1145/564585.564601 · Cited by 1,727 · cited 1×
“Distributed consensus, infamous for its limited scalability, was for decades perceived as a synchronization primitive that is to be used only in applications in desperate need of consistency and only among few nodes (see e.g., [8, 28]).”
Research works printed but not linked: 1
- Istvan, Z., Sidler, D., Alonso, G., Vukolić, M.: Consensus in a box: inexpensive coordination in hardware. In: Proceedings of the 13th USENIX Symposium on Networked Systems Design and Implementation, NSDI (2016)
Cited by
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
“Reference [40] contrasts proof-of-work and BFT consensus protocols, and offers an excellent overview of the state of”
BackgroundAn Overview of Blockchain Technology: Architecture, Consensus, and Future Trends
Zheng, Z., Xie, S., Dai, H., Chen, X., & Wang, H. (2017) · 2017 IEEE International Congress on Big Data (BigData Congress) · doi:10.1109/bigdatacongress.2017.85 · Cited by 4,515
“Table II gives a comparison between different consensus algorithms and we use the properties given by [32].”
MethodBlockchain challenges and opportunities: a survey
Zheng, Z., Xie, S., Dai, H. N., Chen, X., & Wang, H. (2018) · International Journal of Web and Grid Services · doi:10.1504/ijwgs.2018.095647 · Cited by 3,651
Casino, F., Dasaklis, T. K., & Patsakis, C. (2019) · Telematics and Informatics · doi:10.1016/j.tele.2018.11.006 · Cited by 2,557
“Therefore, nodes must reach to an agreement on which transactions must be kept in the blockchain to guarantee that there will be no corrupt branches and divergences (Vukolić, 2015; Christidis and Devetsikiotis, 2016).”
Blockchain technology in the energy sector: a systematic review of challenges and opportunities
Andoni, M., Robu, V., Flynn, D., Abram, S., Geach, D., Jenkins, D., McCallum, P., & Peacock, A. (2019) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2018.10.014 · Cited by 2,426
“Many variants of BFT-based protocols have been proposed (see [60] for a detailed review) by key developers,”
Background
Metadata
- Authors
- Vukolić, M.
- Affiliations
- IBM Research - Zurich (CH)
- Corresponding author
- Vukolić, Marko
- ORCID
- Vukolić, Marko
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer International Publishing
- Published
- 2016
- Volume
- LNCS-9591
- Pages
- 112-125
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2486460265
- Cited by
- 1,051
- References
- 60
- Citations by year
- 2026: 23 · 2025: 37 · 2024: 64 · 2023: 95 · 2022: 104 · 2021: 158 · 2020: 171 · 2019: 207 · 2018: 133 · 2017: 43 · 2016: 15
- FWCI
- 113.02
- Type
- conference paper
- Language
- en
- Open access
- green
- inria.hal.science
- Licence
- Locations
- Lecture notes in computer science (publishedVersion)
- HAL (submittedVersion, cc-by)
- Topics
- Physical Sciences › Computer Science › Information Systems › Blockchain Technology Applications and Security
- Physical Sciences › Computer Science › Computer Networks and Communications › Distributed systems and fault tolerance
- Physical Sciences › Computer Science › Information Systems › Blockchain Technology in Education and Learning
- Keywords
- blockchain scalability, proof-of-work, Byzantine fault tolerance, state machine replication, consensus algorithms, Bitcoin, Ethereum, cryptocurrency platforms, throughput, consensus latency
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: The Quest for Scalable Blockchain Fabric: Proof-of-Work vs. BFT Replication. https://app.cochat.ai/papers/10.1007/978-3-319-39028-4_9
- The paper
- Vukolić, M. (2016). The Quest for Scalable Blockchain Fabric: Proof-of-Work vs. BFT Replication. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-319-39028-4_9
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.