Good morning, list!

That seems like a good analysis, Peter, thanks for writing that up.

The following is an explanation of why I decided to create Garbageman. Apologies for its length. I tried to make it shorter, but I felt like I needed a lot of space to catch everyone up to the pro-filtering (pro-rate-limiting) position, which I’ve not seen represented much on this list. Please reach out to me if you need something clarified or if I got anything wrong. I am constantly revising my position based on new information, so please do not interpret it as carved in stone.

Also, please let me know if this list is not the proper venue for this discussion. It gets kind of philosophical.

For those who don't know, I made Garbageman as a hackathon project to demonstrate that the battle against spam is not hopeless.

The project's mission of stopping Libre Relay's spread of garbage around the bitcoin network has proven very popular among noderunners, so I decided to continue developing it in order to meet this demand.

As I've discussed the spam issue with many, many people over the last couple of years, I've noticed that those in the anti-filter camp often use LR as a rhetorical device, effectively arguing "there's no way to stop this". Well, Garbageman is an assertion to the contrary. I think the battle should be fought, and that we should see how it plays out, because I think we can win. For me, winning means keeping bitcoin both spam-resistant and censorship-resistant.

Almost no one I've ever talked to likes the spam, even those in the anti-filter camp. Likewise, almost no one I know who runs a node wants to relay non-monetary transactions. But bitcoiners are feeling demoralized after the BRC-20 attack of 2023-24, which expanded the utxoset from 5GB to 12GB [0], significantly raising the minimum cost of a bitcoin node, while core maintainers refused to accept PRs that would have mitigated the spam. So I hope that Garbageman can be a demonstration that all is not lost, and that noderunners who wish to shoulder some responsibility can make a big enough impact to deter spammers, if we all work together.

Peter's OP, while containing a lot of useful analysis, also contains some inaccuracies I would like to correct.

While Peter characterizes Garbageman as an "attack" - and he is correct that it is an attack on Libre Relay - what he leaves out is that Libre Relay itself is an attack on bitcoin, and thus Garbageman is a defensive measure from the point of view of the bitcoin network.

Specifically, Libre Relay facilitates denial-of-service attacks on bitcoin, because it assists Ponzi promoters in launching their Ponzis using metaprotocols directly on bitcoin, which, as we've seen with past waves of spam, can easily overwhelm block space, sending fees sky-high for months on end. This of course crowds out real monetary usages, such as merchants in developing countries trying to start self-custodial Lightning points-of-sale. It also tends to encourage utxoset bloat (even if the arbitrary data itself is not stored in the utxoset, as we saw with BRC-20's ~tripling of utxoset data [0] using the inscriptions hack to stuff data into the witness).

That is to say: Libre Relay intentionally increases the likelihood that people will not be able to use bitcoin as money. Permissionless money is, of course, the primary service that bitcoin offers, and its entire reason for existence. So when Libre Relay facilitates the mining of transactions associated with altcoin Ponzis on bitcoin, it is actively complicit in perpetrating denial-of-service attacks against bitcoin.

LR operates by using the peer relay network in an unintended way. It attempts to circumvent filters active on honest nodes by preferentially peering with other LR nodes. Garbageman subverts this mechanism by signaling on the same bit that LR nodes use to identify other LR nodes, then throwing away any garbage that comes its way. Assuming that noderunners who don't like spam vastly outnumber those who do (very likely in my experience), it should be fairly straightforward to protect bitcoin against LR's abuse by using up the preferential connections on LR nodes, preventing them from finding each other.

"NODE_LIBRE_RELAY" is not defined anywhere in bitcoin core or any other official documentation. Bit 29 is just a random bit reserved for future use, as far as the bitcoin protocol itself is concerned. So when Peter says Garbageman "falsely advertises the NODE_LIBRE_RELAY service bit", this is incorrect. It is not possible for GM or any other software to misuse this bit, as it has no official significance.

Peter also claims that the Garbageman noderunner community's goal is to "[prevent] people from getting transactions that they disagree with mined". This is also false. In this claim, as filter opponents often do, Peter is conflating spam filtration with censorship. They are, however, complete opposite ends of a spectrum.

Censorship is the complete or near-complete prohibition of transactions for subjective reasons, usually according to some kind of "blacklist" like OFAC. Such behavior is obviously extremely harmful to bitcoin, as one of its core properties is censorship resistance (aka permissionlessness). Luckily, censorship on bitcoin is extremely unlikely, given that just one block template creator with a small percentage of total hashrate can mine whatever transactions it wants. As opponents of filtering love to point out, the miner can even solicit such transactions out-of-band, avoiding mempool filters entirely. They almost never realize that they are merely bolstering the view that bitcoin is hard to censor, and not that it is hard to deter spam on bitcoin.

Spam filtration, conversely, is a rate-limiting of transactions based on objective criteria, which serves to deter, but not completely block, the creation and confirmation of abusive transactions into the chain. Spam filtration, in contrast to censorship, is harmless, and in fact absolutely essential to bitcoin's survival. Why? Because bitcoin's purpose as money is impossible to codify into the consensus rules. Even if we activated some kind of hashing or signing scheme to prevent arbitrary data by consensus (such as the one from Greg Maxwell that Peter brought up in an earlier thread [1]), such a change would still not fully prohibit the abuse of key grinding, etc, for storing arbitrary data (though it would increase costs substantially).

What this means is that bitcoin's identity as money is only enforceable at the social and mempool policy layers. So when core devs enumerate the "three reasons" [2] mempool policy exists, they are missing reason 4:

4) Making sure bitcoin stays money

Spam filtration is thus a vital component to bitcoin's success, if its goal is to be the best money ever.

Yes, consensus is king, but if we deny the importance of the social and mempool policy layers in maintaining bitcoin's identity as money, then bitcoin will inevitably cease to be money and become corrupted into something resembling Ethereum; that is: a giant dumpster fire of nobody-knows-what.

So when Libre Relay undermines spam filtration, it is not only facilitating DoS attacks on bitcoin; it is contributing to a situation in which the DoS becomes permanent, because bitcoin is no longer money at all.

A blockchain's technology is tightly intertwined with its culture. We've seen historical examples of how tech influences culture, and vice versa. Some examples:

- In BSV, the blocks are so huge and the transaction set so unwieldy, that everyone thinks it's absurd for individuals to run nodes (because it is).
- In Ethereum:
- The blockchain is large and complex - so individuals generally think running full nodes is unimportant - so very few people run full nodes - so the devs are not concerned with making it easier for people to run full nodes.
- The leadership has no principles and no particular vision for what the blockchain is trying to achieve - so short-term incentives dominate.
- The contracting language is very challenging to secure - so making useful contracts that actually work is deprioritized - so 99.99% of the activity is dedicated to scamming.
- In Monero, the supply is difficult to audit - so everyone thinks that auditing the supply is unimportant.

The list goes on and on. The point is that, if we still want bitcoin to be money in a few years, we need to fight to make sure that monetary transactions dominate, and that other use cases do not get the upper hand. If making payments with bitcoin becomes too difficult, then the culture will simply stop valuing payments.

We've already seen a concerning shift in this direction over the last decade as the Lightning Network has been getting built out. During that time, bitcoin’s culture has shifted such that statements from prominent figures unironically discourage spending bitcoin at merchants that directly accept it. Getting Lightning to where it is today took 4 soft forks, a fork war, and a decade of hard work from some of our best devs. Now that Lightning works, we should go all-in on making sure merchants are adopting it, instead of letting non-monetary use cases drown it out.

The anti-filter side seems to think that other use cases cannot drown out the monetary use case, because of transaction fees. In order to believe that fees are sufficient to make sure bitcoin stays money, you'd have to assume that cloud storage with ironclad censorship resistance, immutability, and availability guarantees, for any arbitrary data, for a single upfront fee, for the rest of eternity, would have less demand than Lightning channel opens and closes. This claim seems terribly dubious to me, as it’s already been proven that Ponzi gamblers are willing to dump millions of dollars into fees in order to store their garbage. And we haven’t even cracked the surface of all possible non-monetary “use cases”, because bitcoin’s maintainers have historically been hostile to these uses, so the vast majority of their would-be creators have simply not even considered bitcoin an option.

Currently, however, core devs are very fond of "incentive compatibility" (or "consensus maximalism"). As far as I understand it, this means making mempool policy as close as possible to the consensus rules, so that miners can maximize their short-term profits. While this is a good thing to design for generally because it makes bitcoin much more predictable, it becomes harmful when taken to its logical extreme. Since bitcoin's identity as money cannot be enforced at the consensus layer, and since non-monetary use cases have orders of magnitude more economic demand than monetary ones, incentive compatibility, when maximized above all other concerns, means stuffing bitcoin with as much meaningless garbage as possible. This implies that incentive compatibility is ultimately incompatible with bitcoin remaining money.

Sensible mempool filters are thus the single most powerful tool in our arsenal for giving Lightning a fighting chance and making sure bitcoin stays money for the long term. In addition to sending a strong social signal as to what noderunners prefer, they also allow the relay network to raise costs on spammers, while giving a free ride to actual payments, which are the whole reason the relay network exists. They are the only way I know of for bitcoin’s social layer to exert direct economic pressure on spammers.

Yes, there are most likely slight centralization pressures that can result from large miners soliciting high-fee spam out-of-band, but if enough noderunners are filtering abusive transactions, miners confirming large amounts of these transactions can be seen as hostile, and hostile mining pools have historically yielded to sufficient social pressure, because for a mining pool, social pressure often translates, directly or indirectly, to economic pressure.

If mining pools persist in mining blocks filled with garbage, that will be a sign that we need to break up the mining pools (by encouraging their hashers to boycott them), or, in extreme cases, to fire the miners by changing the PoW algorithm. It would seem that sensible mining pool operators would stop misbehaving well before this point, to avoid undermining their (presumably large) investment.

Fortunately, if the community of noderunners comes together and decides on sensible defaults, the mining pools have historically heeded its decisions. Prior to mempoolfullrbf, it was rare to see mining pools flouting the will of the noderunners. This is because the core maintainers always listened to the noderunners when deciding on the default mempool policy. However, for some reason, in the case of mempoolfullrbf, core devs decided to keep it defaulted to “off”, even though the vast majority of noderunners felt that it was a sensible thing to turn on. I worked at a company that provides turnkey bitcoin nodes during that episode, and we even exposed mempoolfullrbf as a config option because users wanted to be allowed to turn it on.

Peter himself, using Libre Relay, was ultimately responsible for getting this option defaulted to “on” in core, by taking the battle directly to the mining pools. What the anti-filter crowd does not seem to realize is that Peter never would have succeeded if the noderunner community had been opposing him on this. Practically everyone agreed that fullrbf was long past due, except a handful of people who didn’t understand that zeroconf is fundamentally insecure, and that Lightning is way better if you don’t want to wait for a confirmation.

Peter should be commended for finally getting fullrbf active on mainnet. But Libre Relay has now outlived its utility. LR has now been converted into a tool for strong-arming core into removing all its filters, and shoving garbage down everyone’s throats. Though noderunners were happy to go along with LR when it was just about getting fullrbf activated, we are overwhelmingly opposed to raising datacarrier limits. Garbageman is the manifestation of that opposition.

Garbageman protects the bitcoin network by facilitating spam filtration, an essential function for bitcoin, while avoiding censorship. So Peter's chosen subject line, "Censorship Resistant Transaction Relay", is misleading. What he really means is "Spam-Filtration-Resistant Transaction Relay" which, of course, is not desirable at all.

Yes, I’m sure there are strategies for getting LR nodes to detect GM nodes and banning them. And I’m equally sure that, if implemented:

1) Very few people will run them. Only LR nodes are likely to run the garbage-maximizing strategies Peter outlined above. I don’t know of any noderunners in their right minds who would run them.
2) The pro-spam-filtration noderunner community will work around these detection methods any way we can, and we will never give up.

Libre Relay is a direct threat to bitcoin’s ability to remain money, and the threat must be countered.

Garbageman restores the balance.

Best regards,

--Chris Guida

[0]: https://statoshi.info/d/000000009/unspent-transaction-output-set?orgId=1&refresh=10m&viewPanel=8&from=1588309200000&to=now
[1]: https://groups.google.com/g/bitcoindev/c/d6ZO7gXGYbQ/m/QwkPB2HtEQAJ
[2]: https://gist.github.com/instagibbs/c436110890ab25aa9997b13c2270d5ce#why-standardness-policy-exists

On Tue, May 27, 2025 at 5:42 AM John Carvalho <john@synonym.to> wrote:
I noticed your mention of a missing pubkey identity capability. 

A censorship-resistant key-based discovery mechanism is available, PKDNS, at github.com/pubky/pkarr (also /mainline and /pkdns), which essentially provides public-key domains controlled by the keyholder. 

No blockchains, just the largest, oldest, p2p network on earth, Mainline DHT.

This could be used to dynamically provide or update any endpoint, associate or disassociate keys, or create revokable account-based sessions, etc.

These links may address peoples' likely counterarguments:
https://medium.com/pubky/public-key-domains-censorship-resistance-explained-33d0333e6123
https://medium.com/pubky/mainline-dht-censorship-explained-b62763db39cb

Maybe this helps you, or others looking for such primitives!
 
--
John Carvalho


On Tue, May 27, 2025 at 12:23 PM Peter Todd <pete@petertodd.org> wrote:
Recently proponents of transaction "filtering" have started sybil attacking
Libre Relay nodes by running nodes with their "garbageman" fork¹. This fork
falsely advertise the NODE_LIBRE_RELAY service bit, silently discards
transactions that would be relayed by real Libre Relay nodes, and does not
provide any. Additionally, they have made clear that they intend to ramp up
this sybil attack with the aim of preventing people people from getting
transactions that they disagree with mined:

        The costs will increase even more once Libre Relay’s DoS attacks on
        bitcoin are countered by enough defensive nodes.
        -Chris Guida https://delvingbitcoin.org/t/addressing-community-concerns-and-objections-regarding-my-recent-proposal-to-relax-bitcoin-cores-standardness-limits-on-op-return-outputs/1697/4

They have also put effort into making the attack more than a simple proof of
concept, e.g. by adding code that attempts to make it more difficult to detect
attacking nodes, by keeping track of transactions received from peers, and then
replying to inv messages with those transactions even when they were
discarded².

With this attack in mind, I thought this would be a good opportunity to review
the math on how effective this type of attack is, as well as some of the
mitigations that could be implement to defeat sybil attacks on transaction
relaying. In particular, I'll present a defense to sybil attacks that is
sufficiently powerful that it may even negate the need for preferential peering
techniques like the NODE_LIBRE_RELAY bit.

Note that I don't deserve credit for any of these ideas. I'm just putting down
in writing some ideas from Gregory Maxwell and others.


# The Effectiveness of Sybil Attacks on Transaction Relaying

Non-listening nodes make a certain number of outgoing, transaction relaying,
connections to listening nodes. In the case of Bitcoin Core, 8 outgoing
transaction relaying nodes; in the case of Libre Relay, an additional 4
outgoing connections to other Libre Relay nodes to relay transactions relevant
to them.

For a sybil attack to succeed against a non-listing node, every one of the N
outgoing connections must be either a sybil attacking node, or a listening node
that itself has been defeated by sybil attack. Additionally, Bitcoin Core makes
outgoing IPv4 and IPv6 connections to a diversity of address space, so the
sybil attacking nodes need to themselves be running on a diverse set of IP
addresses (this is not that difficult to achieve with VPS providers these
days). Thus if the sybil attacking nodes are a ratio of q to all nodes, the
probability of the attack succeeding is q^N.

Against Libre Relay, N=4, this means that the attacker needs to be running ~84%
of all NODE_LIBRE_RELAY advertising nodes to have an attack success probability
of ~50%. Based on information from my Bitcoin seed node, there appear to be
about 15 Libre Relay nodes, so for a 50% attack success probability the
attackers would need to run about 85 attack nodes. If N was increased to 8, the
attackers would need about 172 nodes to achieve the same success rate.

Against *listening* nodes a different type of attack is necessary. The reason
for this is that defenders can easily defeat sybil attacks against listening
nodes by simply connecting to ~all listening nodes at once to ensure that
transaction propagation succeeds. Of course, the attacker can in turn do things
like attempt to exhaust connection slots of Libre Relay nodes, or simply DoS
attack them with packet floods. But those are different types of attack than
the sybil attack we are discussing here.


# Prior Art: Defeating Block Propagation Sybil Attack

Bitcoin Core already includes a defense against sybil attack for block
propagation: the feeler node system. Basically, every ~2 minutes an outgoing
connection is made to a gossiped address to check if a connection can be made;
successful connections are recorded in a table of "tried" addresses. If no new
blocks have been received for 30 minutes, these tried addresses are then used
every 10 minutes to try to find a peer that does know about a new block.

Since this process goes on indefinitely, so long as outgoing connections are
themselves not censored (e.g. by the ISP), the node should eventually find a
non-sybil attacking node and learn about the true most-work chain. Even in
normal operation periods of >30minutes between blocks are fairly common, so
this defense will (eventually) work even if a forked chain exists with some
hash power extending it.

This approach is relatively straightforward for block propagation, as there is
a clear metric: the most-work chain. Peers that aren't giving you the most-work
chain can be ignored, and new peers found.  Proof-of-work's inherently
self-validating property means that doing this is cheap and straight forward.


# Directionality

A subtlety to the information censorship sybil attack is there are actually two
different simultaneous attacks: the attack on preventing you from learning
about new information, and the attack on preventing you from distribute new
information to others.

With block propagation, most nodes most directly care about the first class of
attack: they want to learn about the most-work chain, and do not want that
information censored from them.

For miners, in addition to knowing what the most-work chain is, they
(typically³) have a strong incentive to get their new blocks to all nodes as
quickly as possible. Also, all nodes have at least some incentive to do this as
Bitcoin will not function properly if miners are getting censored.

These attacks are not the same! The most-work-chain metric is only directly
detecting and preventing the first class of attack. It only prevents the second
attack indirectly, by making it easier for honest nodes to learn about new
blocks and attempt to themselves propagate that information further.


# Most Fees Metric

For transaction relaying, the moral equivalent to the most-work chain metric
are metrics based on the amount of new transaction fees that peers are
advertising to you. Unfortunately this isn't as straightforward to implement as
the most-work chain metric for a few reasons:

1) Resolution: differences in chain work are very clear, with even a single
   additional block being a very significant difference. For transaction relaying,
   we'd like to be able to successfully relay transaction types that only add a
   small % to total fees.
2) Bandwidth: a chain of 80 byte headers is sufficient to prove most-work;
   transactions are much larger.
3) Double-spends: mempools are not a consensus. Your peers may have
   transactions that conflict with your transactions, yet in ways that don't
   constitute a worthwhile RBF replacement (e.g. two different transactions
   with the same fees and fee-rate).

For example, one straight-forward approach would be to simply keep track of a
decaying average of new fees/sec each peer had advertised to you prior to you
advertising the transaction to them. Periodically, you could drop the peer with
the lowest new fees/sec ranking, and then connect to a new peer.

However, it's not clear that this approach has sufficient resolution to
actually detect censorship of relatively uncommon transaction types.
Additionally, since transaction broadcasting is a one-shot event - we don't
have a mempool synchronization mechanism - this approach may not work well if
transaction demand is bursty.


# Most-Fees Next (Dobule) Block Mempool

With the upcoming cluster mempool functionality that is expected to be added to
Core in the near future, transactions will be stored in memory in clusters
ordered by fees: essentially the order in which optimal blocks would be
created. This will make it computationally cheap to determine what the optimal
next block (or blocks) will be by simply iterating through transactions in
order, and stopping when N weight worth of transactions have been found.

Thus nodes can cheaply compute the total fees in the top one or two blocks
worth of transactions they currently have in their mempool, and advertise this
fact to their peers. Finally, to prevent lying, we can add a mechanism for a
peer to get a copy of all these transactions to ensure that they're not missing
out on anything paying enough fees to get mined soon.

While beyond the scope of this summary, there are many set-reconciliation
techniques available to do this in a bandwidth efficient manner. Basically,
through the existing transaction relay mechanisms we can expect mempools to be
relatively consistent between nodes. Thus, to get all transactions that your
peer has for the next block or two that you do not, you just need to transfer
the deltas between their next-block(s) mempool and yours.

Concretely, suppose we do this with the next two blocks worth of transactions.
At worst, each node would need to periodically create a maximum 8MB serialized
"double-block", using up to 8MB of ram. Secondly, to apply this to all outgoing
connections, you'd need to periodically use a set-reconciliation protocol to
download the differences between each of your outgoing peers' double-blocks,
and attempt to add any newly discovered transactions to your mempool. At worst
for 8 peers this would be 64MB of useless data to download, assuming every
single transaction was a conflicting double-spend. Not great. But not that bad.

As with the average fees idea, periodically you would drop the peer advertising
the lowest double-block of fees, and then connect to a new peer to see if
they're better.

Now consider what happens if you are sybil attacked. Due to RBF, with
synchronous mempools across different nodes with the same standardness policies
will have very similar transaction sets; even without active synchronization
long-running mempools across different nodes are already very similar in terms
of total fees. Thus even a small difference in transaction relay policy will
show up as missing transactions. This difference will translate into the sybil
attacking node(s) getting dropped, and honest nodes with policy compatible with
yours eventually being found.


## Peers With More Liberal Relay Policy

If you apply set reconciliation to a peer with a *more* liberal relay policy
than you, they'll have transactions that you will not accept. For example,
imagine the case of a peer that now accepts a new version number.

One way to deal with this could be to just drop peers that give you
transactions that you consider non-standard. So long as reconciliation is only
applied to a subset of all transaction relaying peers, this is fine. Indeed,
even if this is applied to all transaction relaying peers, Bitcoin Core already
connects to additional peers in blocks-only mode. So you'll still get send and
receive blocks and maintain consensus.


## Privacy

Tracking what transactions are in mempools is a potential way for attackers to
trace transactions back to their origin. Provided that set-reconciliation is
only a secondary transaction relay mechanism, with sufficient time delays, this
should not impact privacy as under normal operation transactions will have
already propagated widely making the set reconciliation data non-sensitive.


# Manual Peering With Known-Honest Friendly Nodes

More of a social solution than a technical solution, we should encourage people
to manually peer with other nodes they have a personal relationship with.  This
is a powerful technique against sybil attacks for the simple reason that
person-to-person relationships can evaluate honesty in much more powerful ways
than any code could possibly do so.

At the moment, actually doing this is inconvenient. Ideally we would have a
mechanism where node operators could get a simple pubkey@address connection
string from their node to tell to their friends, and equally, import that same
connection string into their bitcoin.conf. This mechanism should use some kind
of node identity to defeat MITM attacks, and also ensure that connection limits
are bypassed for friendly nodes. The existing addnode mechanism doesn't quite
achieve this. Notably, without a node identity mechanism, there's no way for
someone with a static IP address to whitelist a friend's node with a non-static
IP address.


# Footnotes

1) Chris Guida's "garbageman" branch: https://github.com/chrisguida/bitcoin/tree/garbageman,
   first presented at the btc++ mempool edition (2025) hackathon
2) https://github.com/chrisguida/bitcoin/commit/e9a921c045d64828a5f0de58d8f2706848c48fd2?s=09
3) https://petertodd.org/2016/block-publication-incentives-for-miners

--
https://petertodd.org 'peter'[:-1]@petertodd.org

--
You received this message because you are subscribed to the Google Groups "Bitcoin Development Mailing List" group.
To unsubscribe from this group and stop receiving emails from it, send an email to bitcoindev+unsubscribe@googlegroups.com.
To view this discussion visit https://groups.google.com/d/msgid/bitcoindev/aDWfDI03I-Rakopb%40petertodd.org.

--
You received this message because you are subscribed to the Google Groups "Bitcoin Development Mailing List" group.
To unsubscribe from this group and stop receiving emails from it, send an email to bitcoindev+unsubscribe@googlegroups.com.
To view this discussion visit https://groups.google.com/d/msgid/bitcoindev/CAHTn92zkmfw2KwZCTRyGhnYPASWBUoLaxV65ASYpPeBUpX1SWw%40mail.gmail.com.

--
You received this message because you are subscribed to the Google Groups "Bitcoin Development Mailing List" group.
To unsubscribe from this group and stop receiving emails from it, send an email to bitcoindev+unsubscribe@googlegroups.com.
To view this discussion visit https://groups.google.com/d/msgid/bitcoindev/CAAANnUwHcd1w6phwyfDKebzEabAtm%3DA3i2qkLDpJ9L47q75T9Q%40mail.gmail.com.