Ming Wu
Ming Wu has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
- Chenxing Li
Shanghai Tree-Graph Blockchain Research Institute, Shanghai, China
2 shared publications - Fan Long
University of Toronto, Toronto, Canada
2 shared publications - Haoxiang Lin
Microsoft Research, Beijing, China
2 shared publications - Hongyu Zhang
Chongqing University, Chongqing, China
2 shared publications - Mao Yang
Microsoft Research, Beijing, China
2 shared publications - Sidi Mohamed Beillahi
University of Toronto, Toronto, Canada
2 shared publications
Latest Publications
- Open Access
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 280-290
CCAgent: Coordinating Collaborative Data Scaling for Operating System Agents via Web3
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 280-290
Open AccessCCAgent: Coordinating Collaborative Data Scaling for Operating System Agents via Web3
- Open Access
- 9 October 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 9 (OOPSLA2) , 726-752
HEMVM: A Heterogeneous Blockchain Framework for Interoperable Virtual Machines
This paper introduces HEMVM, an innovative heterogeneous blockchain framework that seamlessly integrates diverse virtual machines (VMs), including the Ethereum Virtual Machine (EVM) and the Move Virtual Machine (MoveVM), into a unified system. This integration facilitates interoperability while retaining compatibility with existing Ethereum and Move toolchains by preserving high-level language constructs. HEMVM’s unique cross-VM operations allow users to interact with contracts across various VMs using any wallet software, effectively resolving the fragmentation in user experience caused by differing VM designs. Our experimental results demonstrate that HEMVM is both fast and efficient, incurring minimal overhead (less than 4.4%) for intra-VM transactions and achieving up to 9,300 TPS for cross-VM transactions. Our results also show that the cross-VM operations in HEMVM are sufficiently expressive to support complex decentralized finance interactions across multiple VMs. Finally, the parallelized prototype of HEMVM shows performance improvements up to 44.8% compared to the sequential version of HEMVM under workloads with mixed transaction types.
- 9 October 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 9 (OOPSLA2) , 726-752
Open AccessHEMVM: A Heterogeneous Blockchain Framework for Interoperable Virtual Machines
This paper introduces HEMVM, an innovative heterogeneous blockchain framework that seamlessly integrates diverse virtual machines (VMs), including the Ethereum Virtual Machine (EVM) and the Move Virtual Machine (MoveVM), into a unified system. This integration facilitates interoperability while retaining compatibility with existing Ethereum and Move toolchains by preserving high-level language constructs. HEMVM’s unique cross-VM operations allow users to interact with contracts across various VMs using any wallet software, effectively resolving the fragmentation in user experience caused by differing VM designs. Our experimental results demonstrate that HEMVM is both fast and efficient, incurring minimal overhead (less than 4.4%) for intra-VM transactions and achieving up to 9,300 TPS for cross-VM transactions. Our results also show that the cross-VM operations in HEMVM are sufficiently expressive to support complex decentralized finance interactions across multiple VMs. Finally, the parallelized prototype of HEMVM shows performance improvements up to 44.8% compared to the sequential version of HEMVM under workloads with mixed transaction types.
- Open Access
- 23 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 545-549
Reduction Fusion for Optimized Distributed Data-Parallel Computations via Inverse Recomputation
- 23 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 545-549
Open AccessReduction Fusion for Optimized Distributed Data-Parallel Computations via Inverse Recomputation
- Open Access
- 23 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 27-38
dl²: Detecting Communication Deadlocks in Deep Learning Jobs
- 23 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 27-38
Open Accessdl²: Detecting Communication Deadlocks in Deep Learning Jobs
- Open Access
- 6 June 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Storage
- Vol. 20 (3) , 1-34
LVMT: An Efficient Authenticated Storage for Blockchain
Authenticated storage access is the performance bottleneck of a blockchain, because each access can be amplified to potentially O (log n ) disk I/O operations in the standard Merkle Patricia Trie (MPT) storage structure. In this article, we propose a multi-Layer Versioned Multipoint Trie (LVMT), a novel high-performance blockchain storage with significantly reduced I/O amplifications. LVMT uses the authenticated multipoint evaluation tree vector commitment protocol to update commitment proofs in constant time. LVMT adopts a multi-layer design to support unlimited key–value pairs and stores version numbers instead of value hashes to avoid costly elliptic curve multiplication operations. In our experiment, LVMT outperforms the MPT in real Ethereum traces, delivering read and write operations 6× faster. It also boosts blockchain system execution throughput by up to 2.7×.
- 6 June 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Storage
- Vol. 20 (3) , 1-34
Open AccessLVMT: An Efficient Authenticated Storage for Blockchain
Authenticated storage access is the performance bottleneck of a blockchain, because each access can be amplified to potentially O (log n ) disk I/O operations in the standard Merkle Patricia Trie (MPT) storage structure. In this article, we propose a multi-Layer Versioned Multipoint Trie (LVMT), a novel high-performance blockchain storage with significantly reduced I/O amplifications. LVMT uses the authenticated multipoint evaluation tree vector commitment protocol to update commitment proofs in constant time. LVMT adopts a multi-layer design to support unlimited key–value pairs and stores version numbers instead of value hashes to avoid costly elliptic curve multiplication operations. In our experiment, LVMT outperforms the MPT in real Ethereum traces, delivering read and write operations 6× faster. It also boosts blockchain system execution throughput by up to 2.7×.