REVIEW 5 cited by
Moonshot: Optimizing Chain-Based Rotating Leader BFT via Optimistic Proposals
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
abstract
Existing chain-based rotating-leader BFT SMR protocols for the partially synchronous network model with constant commit latencies incur block periods of at least $2\delta$ (where $\delta$ is the message transmission latency). While a protocol with a block period of $\delta$ exists under the synchronous model, its commit latency is linear in the size of the system. To close this gap, we present the first chain-based BFT SMR protocols with $\delta$ delay between the proposals of consecutive honest leaders and commit latencies of $3\delta$. We present three protocols for the partially synchronous model under different notions of optimistic responsiveness, two of which implement pipelining. All of our protocols achieve reorg resilience and two have short view lengths; properties that many existing chain-based BFT SMR protocols lack. We present an evaluation of our protocols in a wide-area network wherein they demonstrate significant increases in throughput and reductions in latency compared to the state-of-the-art, Jolteon. Our results also demonstrate that techniques commonly employed to reduce communication complexity$\unicode{x2014}$such as vote-pipelining and the use of designated vote-aggregators$\unicode{x2014}$actually reduce practical performance in many settings.
Forward citations
Cited by 5 Pith papers
-
Prefix Consensus For Censorship Resistant BFT
Prefix Consensus, a new primitive where parties output consistent low/high prefixes, is solvable asynchronously in exactly three rounds, and yields leaderless BFT consensus with at most f censored slots after GST.
-
Multimmit: Extending Blocks for Faster Finality
Multimmit finalises transaction blocks in one voting round with roughly 3δ average latency from dissemination, confining a faulty producer's damage to its own chain.
-
The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus
Two-round-finality leader-based consensus cannot beat ~2.5 data expansion; three-round Carnot protocols reach near-1 under favorable conditions and 1.33–1.5 under attack.
-
Zaptos: Towards Optimal Blockchain Latency
By overlapping execution, storage, and state certification with consensus ordering, Zaptos cuts blockchain latency by up to five network rounds and reports sub-second latency at 20k TPS.
-
IntraLayer: A Platform of Digital Finance Platforms
IntraLayer is a proposed decentralized hub that aggregates data, value, and liquidity across blockchains, but the paper provides only an unsolved framework rather than a working result.
Discussion (0). Continue with ORCID to comment.