2020
DOI: 10.1016/j.dcan.2019.12.001
|View full text |Cite
|
Sign up to set email alerts
|

Performance analysis and comparison of PoW, PoS and DAG based blockchains

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

3
78
0
6

Year Published

2020
2020
2023
2023

Publication Types

Select...
5
2
1
1

Relationship

2
7

Authors

Journals

citations
Cited by 188 publications
(87 citation statements)
references
References 6 publications
3
78
0
6
Order By: Relevance
“…Additionally, the average block confirmation time, in PoW-based and PoA-based BCs, seems to be directly proportional to the BC network size, which complies with the results recently presented in [86]. Comparatively, an average block confirmation time in a PoS-based BC seems unaffected by the network size, which complies with the expectations recently presented in [87].…”
Section: Case Studiessupporting
confidence: 90%
“…Additionally, the average block confirmation time, in PoW-based and PoA-based BCs, seems to be directly proportional to the BC network size, which complies with the results recently presented in [86]. Comparatively, an average block confirmation time in a PoS-based BC seems unaffected by the network size, which complies with the expectations recently presented in [87].…”
Section: Case Studiessupporting
confidence: 90%
“…On the other hand, PoS is an alternative to the PoW consensus protocol [45][46][47][48]. It does not rely on the mining process, but performs a validating one.…”
Section: Blockchain Technologymentioning
confidence: 99%
“…Two of the largest challenges facing BCT are its inability to handle a large volume of transactions simultaneously and its high transaction fees. In order to resolve these drawbacks, a more recent solution is to use a directed acyclic graph (DAG) to implement a distributed ledger [45,46] instead of the BCT linear structure as shown in Figure 4. In mathematics, DAG is a graph that travels in one direction without cycles connecting to other edges.…”
Section: Blockchain Technologymentioning
confidence: 99%
“…However, DAG consensuses use some effective algorithms (e.g., Markov Chain Monte Carlo algorithm [13] and virtual voting algorithm [15]) to address double-spending problem and allow new arrival transactions access the ledger in a forking topology. As a result, the transaction throughput in DAG consensus process will not be limited anymore [16]. Moreover, unlike the single chain design in PoW or PoS, the data stored in DAG-based ledgers is protected by massive forking blocks, thus, the average resource consumption on each node can be very low.…”
Section: Introductionmentioning
confidence: 99%