A nice new paper called Price of Censorship: Censorship Resistance and Throughput under Rational Concurrent Proposers caught my attention a couple of weeks ago and I have been thinking about it ever since. Saraf et al. derived the cost to effectively censor transactions in Multiple Proposer Protocols and bounds under different transaction fee mechanisms (TFMs). Given my current interest in Sybils, I thought that it would be a good idea to look into how the bounds change in the existence of Sybil nodes and how it changes the conclusion of the paper with implications for MCP protocols.
Check it out: Price of Censorship in Multiple Concurrent Proposers under Sybils
1 post - 1 participant
Disclaimer: The market is risky, and investment needs to be cautious. This article does not constitute investment advice. Users should consider whether any opinions, views, or conclusions in this article are in line with their specific circumstances. Investment based on this is at their own risk.