Metraipolis › archive › dc_84078bdb13aa

Hydrozoan: Latency-Adaptive DAG Consensus under Mixed Byzantine and Crash Faults — arXiv:2609.25918

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.25918
License (as archived)
CC0-1.0
Archived
2026-10-08T14:37:22.908Z
SHA-256 of the archived text
f4aae9b83ff97455354e3f06e93e59124179d9c33fd21c9435d08a9238edff19
Stable URL of this page
https://metraipolis.com/documento/dc_84078bdb13aa

How to cite

Hydrozoan: Latency-Adaptive DAG Consensus under Mixed Byzantine and Crash Faults — arXiv:2609.25918 — arXiv (en), https://arxiv.org/abs/2609.25918 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_84078bdb13aa (Metraipolis archive dc_84078bdb13aa, sha256 f4aae9b83ff97455354e3f06e93e59124179d9c33fd21c9435d08a9238edff19)
BibTeX
@misc{dc84078bdb13aa,
  title = {Hydrozoan: Latency-Adaptive DAG Consensus under Mixed Byzantine and Crash Faults — arXiv:2609.25918},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.25918},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_84078bdb13aa; sha256 f4aae9b83ff97455354e3f06e93e59124179d9c33fd21c9435d08a9238edff19},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.25918. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

DAG-based consensus protocols can achieve great throughput and the optimal three-message-delay limit for n = 3f+1 consensus. While two-delay protocols exist, they pay with reduced resilience (requiring 5f+1-style committees) or rely on fallbacks that sacrifice the DAG's high throughput. This paper introduces Hydrozoan, the first DAG protocol with a dual commit path under a hybrid fault model of f Byzantine and c crashed validators, on n = 3f+c+2p+1 validators. Leaders commit in two message delays whenever at most p validators are faulty, and in three otherwise, with no extra messages, no view changes, and multiple leaders per round. Both paths are evaluated on the same DAG, using a novel graded indirect rule to reconcile them so that every honest validator reaches the same decision. We show that under geo-distributed conditions, which path is faster is a property of geography rather than the protocol, as rounds reaching a remote region cost far more than those that do not. The (f, c, p) knobs place the fast quorum where the deployment requires it, allowing a commit in two message delays. If misconfigured, Hydrozoan can still commit in three message delays: Hydrozoan commits on whichever path fires first. We also present Optimal-Hydrozoan, a variant that tolerates one more fault on the fast path, the first construction to match the known lower bound. The safety and liveness of both protocols are machine-checked in Lean 4. Our geo-distributed evaluation shows that Hydrozoan matches Mysticeti's throughput, commits ~25% faster when the fast quorum fits fast regions, and falls back to three message delays when it does not or past p faults, where existing two-delay protocols stall.

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-23 in cs.DC).
Categorie arXiv: Distributed, Parallel, and Cluster Computing (cs.DC) ; Cryptography and Security (cs.CR).
Pagina del lavoro: https://arxiv.org/abs/2609.25918 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T13:47:35.195Z dalla pagina https://arxiv.org/catchup/cs.DC/2026-09-23?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).