AI & ML
MANTA: Unlocking DAG Flexibility in Asynchronous BFT
arXiv cs.DC0 views
arXiv:2610.34419v1 Announce Type: new Abstract: DAG-based BFT protocols marked a shift in consensus design by replacing single-leader proposal paths with concurrent block proposals linked through a shared graph, where references encode consensus evidence. However, under heterogeneous wide-area networks (WANs), existing designs suffer from prolonged rounds and degraded performance due to straggler effects. The root cause is rigid round advancement: replicas move in synchronized rounds, waiting for enough references from the previous round before advancing. We propose a flexible DAG growth framework for asynchronous BFT consensus. Our key observation is that while reference quorums are necessary for safety and liveness, they need not block every round advancement. Instead, the connectivity required for commitment can be accumulated across rounds. Within the framework, we instantiate MANTA, which combines flexible DAG growth to advance by relaxing round synchronization and flexible coin to trigger leader election and finality earlier. Experiments on heterogeneous WAN deployments show that MANTA reduces latency by approximately 30%-70% in our evaluation.
Source:https://arxiv.org/abs/2610.34419PreviousInferScale: Kubernetes-Native Predictive Autoscaling for SLO-Aware AI InferenceNextPrefix Keys and Values Matter Late: RIPE Caching for Self-Speculative Decoding in Looped Language Models
Related posts
The world has a new plan to save nature, but it still needs the money
0Ars Technica

Could data center backlash flip Florida?
0The Verge

Vivo’s first Pro Max phone proves its Ultra is still in a league of its own
0The Verge

Why Peacock is making a huge bet on YouTube
0The Verge
Ninja’s first-ever microwave just replaced two of my kitchen appliances at once
0TechCrunch
Marvell and Lumentum sign definitive 115 billion dollars all-stock merger to build an AI-connectivity leader
0dev.to