Relay censorship resistance through top mempool set reconciliation: Peter Todd posted to the Bitcoin-Dev mailing list about a mechanism that would allow nodes to drop peers that are filtering high-feerate transactions. The mechanism depends on cluster mempool and a set reconciliation mechanism such as that used by erlay. A node would use cluster mempool to calculate its most profitable set of unconfirmed transactions that could fit within (for example) 8,000,000 weight units (a maximum of 8 MB). Each of the node’s peers would also calculate their top 8 MWU of unconfirmed transactions. Using a highly efficient algorithm, such as minisketch, the node would reconcile its set of transactions with each of its peers. In doing so, it would learn exactly what transactions each peer has in the top of its mempool. Then the node would periodically drop the connection to whichever peer had the least profitable mempool on average.