arXiv (All)
open access
Hopper: Bounded-Memory Collaborative Debiasing for Byzantine-Tolerant Peer Sampling
Byzantine-tolerant peer sampling relies on continuously refreshed views, yet an adversary can bias the identifier streams used to construct them. Frequency-aware debiasing downweights overrepresented identifiers, but existing designs rely on cumulative per-identifier counts. We show that even exact,
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
- Hopper: Bounded-Memory Collaborative Debiasing for Byzantine-Tolerant Peer Sampling#978362
- AUPE: Collaborative byzantine fault-tolerant peer-sampling#1012742
- AUPE: Collaborative byzantine fault-tolerant peer-sampling#965381
- On the (In)security of Peer-to-Peer Decentralized Machine Learning#134002
- Byzantine-resilient peer sampling for large-scale distributed systems#326214
Record · ID 1035649
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