aboutsummaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorcheshirecatnick <cheshirecatnick@gmail.com>2018-08-29 10:43:44 +0800
committercheshirecatnick <cheshirecatnick@gmail.com>2018-08-29 10:43:44 +0800
commit9dc3cb14ee06a34d99eebaed55bd1f91da7dd8af (patch)
treec8d93cdb815c93644fa445c6e1d7cd184e398be2
parent3a8cab03a64e8b723ba4549f00abc223496627e4 (diff)
downloaddexon-wiki-9dc3cb14ee06a34d99eebaed55bd1f91da7dd8af.tar
dexon-wiki-9dc3cb14ee06a34d99eebaed55bd1f91da7dd8af.tar.gz
dexon-wiki-9dc3cb14ee06a34d99eebaed55bd1f91da7dd8af.tar.bz2
dexon-wiki-9dc3cb14ee06a34d99eebaed55bd1f91da7dd8af.tar.lz
dexon-wiki-9dc3cb14ee06a34d99eebaed55bd1f91da7dd8af.tar.xz
dexon-wiki-9dc3cb14ee06a34d99eebaed55bd1f91da7dd8af.tar.zst
dexon-wiki-9dc3cb14ee06a34d99eebaed55bd1f91da7dd8af.zip
test
-rw-r--r--Home.md2
1 files changed, 1 insertions, 1 deletions
diff --git a/Home.md b/Home.md
index 1252288..6a42659 100644
--- a/Home.md
+++ b/Home.md
@@ -49,7 +49,7 @@ Algorand is designed for large population (> 10K). They use a verifiable random
The consensus of Algorand is based on Byzantine agreement over samples from the whole users. This causes Algorand can only tolerate less than one third of total population. For example, if it sets 1/5 as maximum ratio of Byzantine node among all participants, the ratio of Byzantine node in samples can be bounded by 1/3 with high probability.
-They use gossip mechanism which costs a latency of <img src="https://latex.codecogs.com/svg.latex?O(log(n)) * T_{network}" /> for each message in order to reduce the bandwidth complexity, which means its confirmation time becomes longer when the number of node increases and nodes scattered around the world. With this limitation, the confirmation time will be around one minute if the number of user is expected as 50K. At the same $n$ and $T_{network}$, the confirmation time is affected by malicious. While, DEXON's confirmation time doesn't change as the ratio of malicious increases. If it wants to increase throughput, it must increase maximum blocksize. But increasing maximum blocksize causes a longer confirmation time. This means Algorand is lack of scalability. However, DEXON increases throughput by means of increasing the number of nodes without affecting the confirmation time.
+They use gossip mechanism which costs a latency of <img src="https://latex.codecogs.com/svg.latex?O(log(n))*T_{network}" /> for each message in order to reduce the bandwidth complexity, which means its confirmation time becomes longer when the number of node increases and nodes scattered around the world. With this limitation, the confirmation time will be around one minute if the number of user is expected as 50K. At the same $n$ and $T_{network}$, the confirmation time is affected by malicious. While, DEXON's confirmation time doesn't change as the ratio of malicious increases. If it wants to increase throughput, it must increase maximum blocksize. But increasing maximum blocksize causes a longer confirmation time. This means Algorand is lack of scalability. However, DEXON increases throughput by means of increasing the number of nodes without affecting the confirmation time.
## Bitcoin
|Throughput (TPS)|Latency (seconds)|Data Structure|Consensus|Smart Contract|