arXiv CS
open access
Byzantine-Tolerant Causal Unicast with Constant Message Space Overhead
Causal message ordering provides essential semantics for distributed applications, yet ensuring it within an asynchronous system subject to Byzantine failures presents fundamental theoretical and practical challenges. Prior research establishes that algorithms cannot guarantee both strong safety and
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Byzantine-Tolerant Causal Unicast with Constant Message Space Overhead#1216743
- Byzantine Reliable Broadcast with Causal Ordering#1123469
- Byzantine Reliable Broadcast with Causal Ordering#919329
- Byzantine Causal Reliable Broadcast (BCRB) with Constant-Size Message Metadata#1050205
- Byzantine Causal Reliable Broadcast (BCRB) with Constant-Size Message Metadata#1028659
Record · ID 1210268
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive