Guppy: Efficient Light Clients via Recursive Zero-Knowledge Proofs
Guppy通过让验证者仅承诺状态更新，并利用递归零知识证明维护完整的状态Merkle树，解决了传统轻客户端对验证者造成的负担问题。
0 citationsRead paper
Selected work
Representative Papers
Barnacle: Adaptive Multi-Leader Scheduling for DAG-Based Consensus
本文提出Barnacle，一种自适应多领导调度方法，用于解决DAG共识中因单领导延迟导致的阻塞问题，通过动态调整领导数量来优化交易提交效率。
0 citationsRead paper
Orcaella: Hybrid Fault Tolerance with Client-Selectable Finality Latency
This work investigates the fault-tolerance limits and protocol design for low-latency consensus under a hybrid failure model combining Byzantine faults (f) and crash faults (c). It establishes, for the first time, a tight lower bound of n ≥ 5f + 3c + 1 for two-message-latency commit protocols. The paper proposes a hybrid fault-tolerant consensus protocol featuring both a fast-commit path and a resilient fallback mechanism, enabling clients to select their desired finality latency. Built upon the partial synchrony model and integrating multi-round safety paths with synchronous recovery, the protocol achieves high performance: under a configuration of n=99, f=16, and c=6, it tolerates up to 22% failed replicas (liveness), 16% malicious nodes with 1-RTT safety, and as many as 54% malicious nodes with 2-RTT safety.
0 citationsRead paper
Optimizing an IDE for an Evolving Language Ecosystem
This work addresses the challenges of IDE development posed by the rapid evolution of smart contract languages such as Move by presenting a high-performance IDE support system built atop the Move compiler and adhering to the Language Server Protocol (LSP). Through deep integration with existing language toolchains and the application of incremental parsing and optimized semantic analysis techniques, the system efficiently delivers rich IDE features even as the language undergoes continuous iteration. Deployed successfully within the Sui platform’s Move ecosystem, it significantly enhances developer experience and yields a reusable, evolution-aware IDE construction strategy applicable to other emerging programming language ecosystems.
0 citationsRead paper
Anthemius: Efficient&Modular Block Assembly for Concurrent Execution
Blockchain’s serial execution severely limits throughput, while existing parallel execution engines suffer from resource contention among transactions—particularly under hot-contract workloads—yielding only marginal improvements (e.g., +60%). This paper proposes a resource-access-pattern-aware dynamic block construction algorithm. It combines static analysis with lightweight runtime resource fingerprinting to construct a modular scheduling graph, enabling intelligent transaction partitioning and reordering. The approach requires no client-side hints or optimistic conflict detection and integrates transparently into mainstream parallel execution engines. Experimental evaluation across diverse representative workloads demonstrates over 2× throughput improvement versus baseline serial execution and significantly outperforms state-of-the-art parallel schemes. Crucially, it effectively alleviates the execution bottleneck induced by single hot contracts, marking a substantial advance in scalable blockchain execution.
0 citationsRead paper
Recent publications
Latest Papers
Guppy: Efficient Light Clients via Recursive Zero-Knowledge Proofs
Guppy通过让验证者仅承诺状态更新，并利用递归零知识证明维护完整的状态Merkle树，解决了传统轻客户端对验证者造成的负担问题。
0 citationsRead paper
Barnacle: Adaptive Multi-Leader Scheduling for DAG-Based Consensus
本文提出Barnacle，一种自适应多领导调度方法，用于解决DAG共识中因单领导延迟导致的阻塞问题，通过动态调整领导数量来优化交易提交效率。
0 citationsRead paper
Orcaella: Hybrid Fault Tolerance with Client-Selectable Finality Latency
This work investigates the fault-tolerance limits and protocol design for low-latency consensus under a hybrid failure model combining Byzantine faults (f) and crash faults (c). It establishes, for the first time, a tight lower bound of n ≥ 5f + 3c + 1 for two-message-latency commit protocols. The paper proposes a hybrid fault-tolerant consensus protocol featuring both a fast-commit path and a resilient fallback mechanism, enabling clients to select their desired finality latency. Built upon the partial synchrony model and integrating multi-round safety paths with synchronous recovery, the protocol achieves high performance: under a configuration of n=99, f=16, and c=6, it tolerates up to 22% failed replicas (liveness), 16% malicious nodes with 1-RTT safety, and as many as 54% malicious nodes with 2-RTT safety.
0 citationsRead paper
Optimizing an IDE for an Evolving Language Ecosystem
This work addresses the challenges of IDE development posed by the rapid evolution of smart contract languages such as Move by presenting a high-performance IDE support system built atop the Move compiler and adhering to the Language Server Protocol (LSP). Through deep integration with existing language toolchains and the application of incremental parsing and optimized semantic analysis techniques, the system efficiently delivers rich IDE features even as the language undergoes continuous iteration. Deployed successfully within the Sui platform’s Move ecosystem, it significantly enhances developer experience and yields a reusable, evolution-aware IDE construction strategy applicable to other emerging programming language ecosystems.
0 citationsRead paper
Anthemius: Efficient&Modular Block Assembly for Concurrent Execution
Blockchain’s serial execution severely limits throughput, while existing parallel execution engines suffer from resource contention among transactions—particularly under hot-contract workloads—yielding only marginal improvements (e.g., +60%). This paper proposes a resource-access-pattern-aware dynamic block construction algorithm. It combines static analysis with lightweight runtime resource fingerprinting to construct a modular scheduling graph, enabling intelligent transaction partitioning and reordering. The approach requires no client-side hints or optimistic conflict detection and integrates transparently into mainstream parallel execution engines. Experimental evaluation across diverse representative workloads demonstrates over 2× throughput improvement versus baseline serial execution and significantly outperforms state-of-the-art parallel schemes. Crucially, it effectively alleviates the execution bottleneck induced by single hot contracts, marking a substantial advance in scalable blockchain execution.
0 citationsRead paper