Sustainable blockchain through proof of exercise
Open accessThe DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
Cryptocurrency and blockchain technologies are recently gaining wide adoption since the introduction of Bitcoin, being distributed, authority-free, and secure. Proof of Work (PoW) is at the heart of blockchain's security, asset generation, and maintenance. Although simple and secure, a hash-based PoW like Bitcoin's puzzle is often referred to as “useless”, and the used intensive computations are considered “waste” of energy. A myriad of Proof of “something” alternatives have been proposed to mitigate energy consumption; however, they either introduced new security threats and limitations, or the “work” remained far from being really “useful”. In this work, we introduce Proof of eXercise (PoX): a sustainable alternative to PoW where an eXercise is a real world matrix-based scientific computation problem. We provide a novel study of the properties of Bitcoin's PoW, the challenges of a more “rational” solution as PoX, and we suggest a comprehensive approach for PoX.
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
Tor: The Second-Generation Onion Router
Dingledine, R., Mathewson, N., & Syverson, P. (2004) · doi:10.21236/ada465464 · Cited by 4,104 · cited 1×
“Shuffling can be done via a shuffling service that can be implemented as an onion routing [21] service on Bitcoin’s network peers themselves, or using an external service like TOR [16].”
BackgroundPractical 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 1×
“, [9], [13], [32], [49], [46], following Byzantine fault tolerant (BFT) approaches [10], [31], [22], [27].”
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
A survey on tree edit distance and related problems
Bille, P. (2005) · Theoretical Computer Science · doi:10.1016/j.tcs.2004.12.030 · Cited by 751 · cited 3×
“In computational science, the matrix dimension n can grow up to Billions [57], [36], [7], [28], and thus a petaflops machine may take several months to solve the matrix product, which may serve as an PoX for cryptocurrencies.”
Background
Cited by
Blockchain for AI: review and open research challenges
Salah, K., Rehman, M. H. U., Nizamuddin, N., & Al-Fuqaha, A. (2019) · IEEE Access · doi:10.1109/access.2018.2890507 · Cited by 1,001
“Interested readers may explore Proof of Luck [102], Proof of Exercise [103], Proof of Ownership [104], Proof of Vote [105], and Proof of Retrievability [106] for further discussions on consensus protocols.”
BackgroundA Survey on Consensus Mechanisms and Mining Strategy Management in Blockchain Networks
Wang, W., Hoang, D. T., Hu, P., Xiong, Z., Niyato, D., Wang, P., Wen, Y., & Kim, D. I. (2019) · IEEE Access · doi:10.1109/access.2019.2896108 · Cited by 995
Comparative analysis of blockchain consensus algorithms
Bach, L. M., Mihaljevic, B., & Zagar, M. (2018) · 2018 41st International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO) · doi:10.23919/mipro.2018.8400278 · Cited by 584
Blockchain for Future Smart Grid: A Comprehensive Survey
Mollah, M. B., Zhao, J., Niyato, D., Lam, K.-Y., Zhang, X., Ghias, A. M. Y. M., Koh, L. H., & Yang, L. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.2993601 · Cited by 542
Nguyen, C. T., Hoang, D. T., Nguyen, D. N., Niyato, D., Nguyen, H. T., & Dutkiewicz, E. (2019) · IEEE Access · doi:10.1109/access.2019.2925010 · Cited by 533
A Survey on Blockchain Technology: Evolution, Architecture and Security
Bhutta, M. N. M., Khwaja, A. A., Nadeem, A., Ahmad, H. F., Khan, M. K., Hanif, M. A., Song, H., Alshamari, M., & Cao, Y. (2021) · IEEE Access · doi:10.1109/access.2021.3072849 · Cited by 522
A Vademecum on Blockchain Technologies: When, Which, and How
Belotti, M., Bozic, N., Pujolle, G., & Secci, S. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2019.2928178 · Cited by 498
A Comprehensive Review of Blockchain Consensus Mechanisms
Lashkari, B., & Musilek, P. (2021) · IEEE Access · doi:10.1109/access.2021.3065880 · Cited by 499
Metadata
- Authors
- Shoker, A.
- Venue
- 2017 IEEE 16th International Symposium on Network Computing and Applications (NCA)
- Publisher
- IEEE
- Published
- 2017-10
- Pages
- 1-9
- OpenAlex
- W2774627213
- Cited by
- 85
- References
- 4
- FWCI
- 6.35
- 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
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.