arXiv (All)
open access
Exploring Adaptive Byzantine Quorum Systems to Improve Latency in the WAN
Quorum systems enforce strict consistency in Byzantine fault-tolerant (BFT) state machine replication: Before a value is decided, a subset of replicas (called quorum) must exchange votes for the value. In wide-area networks, the size and composition of a quorum determines the speed at which replicas
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
- Exploring Adaptive Byzantine Quorum Systems to Improve Latency in the WAN#1160992
- Breaking Fault Lines: Unifying TEE-Assisted BFT Consensus in Partially Trusted Worlds#996567
- Robust and Automated Reconfiguration of Byzantine Wide-Area Replication#280101
- State Without a Landlord: An Architecture Proposal for Peer-to-Peer Replication of Durable Workflow State#1011376
- State Without a Landlord: An Architecture Proposal for Peer-to-Peer Replication of Durable Workflow State#965395
Record · ID 1144882
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