A Comparative Study Of Blockchain Algorithms For Non-Fungible Token
In terms of performance, scalability, and latency, NFTs are a crucial implementation for humans no matter in cryptocurrency or digital asset ownership protection. However, there are some concerns for the community to consider before using NFTs technology universalness. The most important issue that...
| Main Author: | |
|---|---|
| Format: | Undergraduates Project Papers |
| Language: | English |
| Published: |
2023
|
| Subjects: | |
| Online Access: | http://umpir.ump.edu.my/id/eprint/40194/ http://umpir.ump.edu.my/id/eprint/40194/1/CA19079.pdf |
| _version_ | 1848825981012279296 |
|---|---|
| author | Woo, Jan Yin |
| author_facet | Woo, Jan Yin |
| author_sort | Woo, Jan Yin |
| building | UMP Institutional Repository |
| collection | Online Access |
| description | In terms of performance, scalability, and latency, NFTs are a crucial implementation for humans no matter in cryptocurrency or digital asset ownership protection. However, there are some concerns for the community to consider before using NFTs technology universalness. The most important issue that is compulsory to overcome is the performance of blockchain algorithms in NFTs and the effect of scalability in each blockchain algorithm. Since a blockchain system is highly dependent on the protocols, a low-performance problem might be experienced. Other than that, a blockchain system might not be able to process if blocks are produced too fast. Therefore, this research will be a breakthrough of NFTs which could evaluate the performance of blockchain algorithms and determine the most suitable algorithms that may apply to NFTs. The proposed algorithms will be evaluated in terms of performance, scalability, and latency. In this research, there will be some selected algorithms, which is Proof-of-Work and Proof-of-Stakes from open resource and modified to the suitable testing criteria to evaluate valid and sufficient data for data visualization. All data will be done in chart view to make all comparative more obvious. From the result, one of the most suitable algorithms will be selected which is Proof-of-Stakes and the reasons are justified as in better performance, good scalability, and less latency. Therefore, this research will be on a testing for algorithms and determine the best algorithms that need to apply in NFTs. |
| first_indexed | 2025-11-15T03:37:33Z |
| format | Undergraduates Project Papers |
| id | ump-40194 |
| institution | Universiti Malaysia Pahang |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-15T03:37:33Z |
| publishDate | 2023 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | ump-401942024-02-07T04:18:19Z http://umpir.ump.edu.my/id/eprint/40194/ A Comparative Study Of Blockchain Algorithms For Non-Fungible Token Woo, Jan Yin QA75 Electronic computers. Computer science In terms of performance, scalability, and latency, NFTs are a crucial implementation for humans no matter in cryptocurrency or digital asset ownership protection. However, there are some concerns for the community to consider before using NFTs technology universalness. The most important issue that is compulsory to overcome is the performance of blockchain algorithms in NFTs and the effect of scalability in each blockchain algorithm. Since a blockchain system is highly dependent on the protocols, a low-performance problem might be experienced. Other than that, a blockchain system might not be able to process if blocks are produced too fast. Therefore, this research will be a breakthrough of NFTs which could evaluate the performance of blockchain algorithms and determine the most suitable algorithms that may apply to NFTs. The proposed algorithms will be evaluated in terms of performance, scalability, and latency. In this research, there will be some selected algorithms, which is Proof-of-Work and Proof-of-Stakes from open resource and modified to the suitable testing criteria to evaluate valid and sufficient data for data visualization. All data will be done in chart view to make all comparative more obvious. From the result, one of the most suitable algorithms will be selected which is Proof-of-Stakes and the reasons are justified as in better performance, good scalability, and less latency. Therefore, this research will be on a testing for algorithms and determine the best algorithms that need to apply in NFTs. 2023-01 Undergraduates Project Papers NonPeerReviewed pdf en http://umpir.ump.edu.my/id/eprint/40194/1/CA19079.pdf Woo, Jan Yin (2023) A Comparative Study Of Blockchain Algorithms For Non-Fungible Token. Faculty of Computing, Universiti Malaysia Pahang Al-Sultan Abdullah. |
| spellingShingle | QA75 Electronic computers. Computer science Woo, Jan Yin A Comparative Study Of Blockchain Algorithms For Non-Fungible Token |
| title | A Comparative Study Of Blockchain Algorithms For Non-Fungible Token |
| title_full | A Comparative Study Of Blockchain Algorithms For Non-Fungible Token |
| title_fullStr | A Comparative Study Of Blockchain Algorithms For Non-Fungible Token |
| title_full_unstemmed | A Comparative Study Of Blockchain Algorithms For Non-Fungible Token |
| title_short | A Comparative Study Of Blockchain Algorithms For Non-Fungible Token |
| title_sort | comparative study of blockchain algorithms for non-fungible token |
| topic | QA75 Electronic computers. Computer science |
| url | http://umpir.ump.edu.my/id/eprint/40194/ http://umpir.ump.edu.my/id/eprint/40194/1/CA19079.pdf |