# Lantern: Finding Committable Transactions via Back-Propagation on DAGs

DevFeed: [Lantern: Finding Committable Transactions via Back-Propagation on DAGs](<https://devfeed.tech/articles/lantern-finding-committable-transactions-via-back-propagation-on-dags-121001.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2609.03315>)

Author: Denglong Li, Gerui Wang, Tian Guan, Mingchao Wan

Published: 2026-11-06T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Databases](<https://devfeed.tech/sources/arxiv-databases.md>), [arXiv: Distributed Computing](<https://devfeed.tech/sources/arxiv-distributed-computing.md>)

Topics: [Transactions](<https://devfeed.tech/topics/transactions.md>), [Blockchain](<https://devfeed.tech/topics/blockchain.md>)

Tags: [aria](<https://devfeed.tech/tags/aria.md>), [batch](<https://devfeed.tech/tags/batch.md>), [benchmarks](<https://devfeed.tech/tags/benchmarks.md>), [blockchain](<https://devfeed.tech/tags/blockchain.md>), [concurrency-control](<https://devfeed.tech/tags/concurrency-control.md>), [cs-db](<https://devfeed.tech/tags/cs-db.md>), [cs-dc](<https://devfeed.tech/tags/cs-dc.md>), [cs-pf](<https://devfeed.tech/tags/cs-pf.md>), [dependency](<https://devfeed.tech/tags/dependency.md>), [dependency-graph](<https://devfeed.tech/tags/dependency-graph.md>), [evaluations](<https://devfeed.tech/tags/evaluations.md>), [execution](<https://devfeed.tech/tags/execution.md>), [high-performance](<https://devfeed.tech/tags/high-performance.md>), [integrate](<https://devfeed.tech/tags/integrate.md>), [protocol](<https://devfeed.tech/tags/protocol.md>), [protocols](<https://devfeed.tech/tags/protocols.md>), [transactions](<https://devfeed.tech/tags/transactions.md>)

## AI overview

Lantern is a deterministic concurrency control protocol designed to work without prior knowledge of transaction read-write sets. It commits zero-out-degree transactions in ascending order using an overwrite-permissive strategy, then applies back-propagation from sink to source vertices to identify more committable transactions. For read-modify-write intensive workloads, it also uses Conflict-Free Batch Selection. Integrated into ChainMaker, Lantern reportedly achieved up to 4.2x Aria's throughput on YCSB and SmallBank benchmarks and raised ChainMaker's execution-layer throughput by at least 2.2x.

## Source excerpt

arXiv:2609.03315v2 Announce Type: replace-cross Abstract: Existing concurrency control protocols either introduce nondeterminism, resulting in a serial execution-replay dependency between primary and replica nodes, or rely on impractical prior knowledge of transaction read-write sets. In this paper, we present Lantern, a deterministic concurrency control protocol tailored for high-performance transaction processing systems operating without prior knowledge. The key insight of Lantern is that all zero-out-degree transaction vertices in the local dependency graph can be safely committed in ascending order using an overwrite-permissive strategy. We further introduce a novel Back-Propagation mechanism that iteratively propagates dependency states from sink to source vertices to identify additional committable transactions. We also propose Conflict-Free Batch Selection (CFBS) for read-modify-write intensive scenarios. We integrate Lantern into the open-source blockchain platform ChainMaker. Extensive evaluations on YCSB and SmallBank benchmarks demonstrate that Lantern achieves up to a 4.2x throughput speedup over Aria and improves the throughput of ChainMaker's execution layer by at least 2.2x.