21 March 2019 in IEEE Access
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. Experimental results show that DLattice reaches a consensus in under 10 seconds, achieves desired throughput, and incurs almost no penalty for scaling to more users.
7 March 2024 in Journal of Information Security and Applications
8 February 2026 in Computer Networks
2 April 2026 in Proceedings of the ACM on Management of Data
The state tree used for blockchain state management has emerged as a core performance bottleneck, primarily due to the latency involved in generating cryptographic commitments during block production and validation. To address this issue, we present a delayed write mechanism that decouples commitment computation from block execution. We introduce the Sliding Window Merkle Tree (SWMT), a cyclic in-memory cache that temporarily buffers recent state updates, deferring their integration into the state tree. SWMT uses a 32-bit window field to efficiently manage cache lifespan and support rapid commitment generation. To handle fluctuating transaction loads, we propose a TCP-inspired congestion control strategy that adapts caching granularity to dynamic workload intensity. Our design can be integrated with existing MPT and Verkle tree structures, while preserving proof succinctness and verifiability. Evaluation on 6 million real Ethereum blocks demonstrates up to a 61.3x reduction in commitment latency, a 6.3x speedup in block execution. These results highlight a practical and deployable approach to enhancing blockchain throughput and scalability.