DLattice: A Permission-Less Blockchain Based on DPoS-BA-DAG Consensus for Data Tokenization

In today’s digital information age, the conflict between the public’s growing awareness of their own data protection and the data owners’ inability to obtain data ownership has become increasingly prominent. The emergence of blockchain provides a new direction for data protection and data tokenization. Nonetheless, existing cryptocurrencies such as Bitcoin using Proof-of-Work are particularly energy intensive. On the other hand, classical protocols such as Byzantine agreement do not work efficiently in an open environment. Therefore, in this paper, we propose a permission-less blockchain with a novel double-DAG (directed acyclic graph) architecture called DLattice, where each account has its own Account-DAG and all accounts make up a greater Node-DAG structure. DLattice parallelizes the growth of each account’s Account-DAG, each of which is not influenced by other accounts’ irrelevant transactions. DLattice uses a new DPoS-BA-DAG(PANDA) protocol to reach consensus among users only when the forks are observed. Based on proposed DLattice, we introduce a process of data tokenization, including data assembling, data anchoring, and data authorization. We implement DLattice and evaluate its performance on 25 ECS virtual machines, simulating up to 500 nodes. The experimental results show that DLattice reaches a consensus in 10 seconds, achieves desired throughput, and incurs almost no penalty for scaling to more users.