DAG-Rider popularized a new paradigm of DAG-BFT protocols, separating dissemination from consensus: all nodes disseminate transactions as blocks that reference previously known blocks, while consensus is reached by electing certain blocks as leaders. This design yields high throughput but confers optimal latency only to leader blocks; non-leader blocks cannot be committed independently. We present Lemonshark, an asynchronous DAG-BFT protocol that reinterprets the DAG at a transactional level and identifies conditions where commitment is sufficient -- but not necessary -- for safe results, enabling nodes to finalize transactions before official commitment, without compromising correctness. Compared to the state-of-the-art asynchronous BFT protocol, Lemonshark reduces latency by up to 65\%.

翻译：DAG-Rider推广了一种全新的DAG-BFT协议范式，将传播与共识分离：所有节点以引用已知区块的方式传播事务区块，而共识则通过选举特定区块为领导者来实现。该设计虽能实现高吞吐量，但仅能为领导者区块提供最优延迟，非领导者区块无法独立提交。我们提出Lemonshark——一种异步DAG-BFT协议，其在事务层面重新解构DAG结构，并识别出对安全结果而言"足够但不必要"的承诺条件，使得节点能在正式承诺前完成事务终局化，且不损害正确性。与当前最先进的异步BFT协议相比，Lemonshark将延迟降低了高达65%。