• Corpus ID: 53699238

DEXON: A Highly Scalable, Decentralized DAG-Based Consensus Algorithm

  title={DEXON: A Highly Scalable, Decentralized DAG-Based Consensus Algorithm},
  author={Taiyu Chen and Wei-Ning Huang and Po-Chun Kuo and Hao Chung and Tzu-Wei Chao},
A blockchain system is a replicated state machine that must be fault tolerant. When designing a blockchain system, there is usually a trade-off between decentralization, scalability, and security. In this paper, we propose a novel blockchain system, DEXON, which achieves high scalability while remaining decentralized and robust in the real-world environment. We have two main contributions. First, we present a highly scalable sharding framework for blockchain. This framework takes an arbitrary… 

Figures and Tables from this paper

SoK: Diving into DAG-based Blockchain Systems

The security and performance of several leading systems are analyzed, followed by discussions and comparisons with concurrent (scaling blockchain) techniques, and open challenges are identified to highlight the potentiality of DAG-based solutions and indicate their promising directions for future research.

C-DAG: Community-Assisted DAG Mechanism with High Throughput and Eventual Consistency

A POV-combined PBFT consensus adopted inside the community and the event-driven global block sequencing algorithm applied between the communities guarantee the convergence and final consistency of C-DAG.

A Survey of Layer-Two Blockchain Protocols

This thorough study systematically creates a broad taxonomy of Layer-2 protocols to help further systematize the knowledge dispersed in the domain and help the readers to better understand the mechanisms behind these protocols.

Dagbase: A Decentralized Database Platform Using DAG-Based Consensus

  • Yepeng DingHiroyuki Sato
  • Computer Science
    2020 IEEE 44th Annual Computers, Software, and Applications Conference (COMPSAC)
  • 2020
Dagbase decentralizes the management and distributes data to prevent threats in untrustworthy environments, which gains benefits from recent DLT and ensures flexibility by decoupling the consensus mechanism from the architecture.

A Markov Process Theory for Network Growth Processes of DAG-based Blockchain Systems

A continuous-time Markov process is set up to analyze the DAG-based blockchain system and it is proved that the QBD process must be irreducible and positive recurrent, and a new method for computing the average sojourn time of any arriving internal tip at this system is proposed.

Parasite Chain Detection in the IOTA Protocol

This paper presents a detection mechanism for a Parasite Chain attack that attempts to revert the history stored in the DAG structure, also called the Tangle, and shows that due to a form of the parasite Chain that is different from the main Tangle it is possible to detect certain types of malicious chains.

Properties of the Tangle for Uniform Random and Random Walk Tip Selection

This paper analyzes the Tangle, a directed acyclic graph that is used (with certain modifications) in various protocols such as IOTA, Byteball, Avalanche or SPECTRE and confirms analytical predictions on the number of tips with uniform random tip selection strategy and provides novel insights on the different phases of growth of cumulative weight.

UCL Centre for Blockchain Technologies

It is shown that contrary to the usual implications of network effects, they do not serve to concentrate the cryptoasset market, nor do they accord any one Cryptoasset a definitive competitive advantage, nor are they consistent enough to be reliable valuation tools.

FSS: A Flexible Scaling Scheme for Blockchain Based on Stale Block Rate

In blockchain, there has long been a contradiction between the limited ability and the uncertain requirements of processing transactions, which seriously restricts the practical application of

A Weak Consensus Algorithm and Its Application to High-Performance Blockchain

  • Qin WangRujia Li
  • Computer Science, Mathematics
    IEEE INFOCOM 2021 - IEEE Conference on Computer Communications
  • 2021
This paper proposes a weak consensus algorithm that only maintains the consistency of relative positions between the messages, and applies it to construct a high-performance blockchain system, called Sphinx, which is significantly faster than current blockchain systems such as Ethereum given the same experimental environment.



ALGORAND AGREEMENT: Super Fast and Partition Resilient Byzantine Agreement

A simple Byzantine agreement protocol with leader election, that works under > 2/3 honest majority and does not rely on the participants having synchronized clocks, that is resilient to arbitrary network partitions with unknown length, and recovers fast after the partition is resolved and bounded message delay is restored.

DFINITY Technology Overview Series, Consensus System

DFINITY consensus algorithm is made to scale through continuous quorum selections driven by the random beacon, which gracefully handles temporary losses of network synchrony including network splits, while it is provably secure under synchrony.

Ouroboros Praos: An Adaptively-Secure, Semi-synchronous Proof-of-Stake Blockchain

Ouroboros Praos is a proof-of-stake blockchain protocol that provides security against fully-adaptive corruption in the semi-synchronous setting and tolerates an adversarially-controlled message delivery delay unknown to protocol participants.

Bitcoin: A Peer-to-Peer Electronic Cash System

This work proposes a solution to the double-spending problem using a peer-to-peer network, where the network timestamps transactions by hashing them into an ongoing chain of hash-based proof-of-work, forming a record that cannot be changed without redoing the proof- of-work.

Algorand: Scaling Byzantine Agreements for Cryptocurrencies

Experimental results show that Algorand confirms transactions in under a minute, achieves 125x Bitcoin's throughput, and incurs almost no penalty for scaling to more users.

Early delivery totally ordered multicast in asynchronous environments

Experimental results show up to O(log (n)) speedup over previous protocols, which matches the authors' prediction of the expected speedup.

A Verifiable Random Function with Short Proofs and Keys

This work gives a simple and efficient construction of a verifiable random function (VRF) on bilinear groups and shows that the scheme can be instantiated with an elliptic group of very reasonable size and can be made distributed and proactive.

Verifiable random functions

This work efficiently combines unpredictability and verifiability by extending the Goldreich-Goldwasser-Micali (1986) construction of pseudorandom functions f/sub s/ from a secret seed s to provide an NP-proof that the value f/ sub s/(x) is indeed correct without compromising the unpredictability of f/ Sub s/ at any other point for which no such a proof was provided.

A Generic Approach to Constructing and Proving Verifiable Random Functions

Verifiable Random Functions (VRFs) as introduced by Micali, Rabin and Vadhan are a special form of Pseudo Random Functions (PRFs) wherein a secret key holder can also prove validity of the function

The Byzantine Generals Problem

It is shown that, using only oral messages, the problem of a group of generals camped with their troops around an enemy city is solvable if and only if more than two-thirds of the generals are loyal; so a single traitor can confound two loyal generals.