Governance

Price of Censorship Resistance in Multiple Proposer Protocols Under Sybils

Read full article at source ↗

Based on a feed excerpt; full article content has not been acquired. Source evidence retrieved 08/10/2026, 03:58:26 UTC.

Briefings

A new paper by Saraf et al. analyzes censorship resistance in Multiple Proposer Protocols (MCP) under Sybil attacks, deriving cost bounds for transaction fees. The study compares scenarios with and without Sybil nodes, revealing how Sybils significantly alter the cost of censorship compared to single-participant models. Key findings include specific throughput thresholds and fee mechanisms that remain stable or shift depending on Sybil density, with implications for protocol security design.

Key points

• Saraf et al. derived cost bounds for censoring transactions in MCP protocols under Rational Concurrent Proposers.
• The study compares censorship costs in single-participant versus multi-participant scenarios with Sybil nodes.

Context and limitations

Evidence covers only the theoretical bounds derived by Saraf et al. for MCP protocols under Sybil attacks, with no empirical testing or real-world protocol implementations included in the scope.

Generated by Bittrees-hosted qwen35-2b sha256:aaf42c8b7c3c on 08/10/2026, 06:10:17 UTC. Based on publisher-provided feed evidence; may not cover the full original article. Check the source for details.

View archived briefing on IPFS
bafybeid4e34lv4icadrgjk2n6fvnp6byvm6q5wg56y2euidsakbgyz5hdq