"If, somehow, it ever runs into a situation where it can help 3^^^3 people, it really should."
I thought the whole idea behind this proposal was that the probability of this happening is essentially zero.
If you think this is something with a reasonable probability, you should accept the mugging.
You were speaking about bounded utility functions. Not bounded probability functions.
The whole point of the Pascal's mugger scenario is that these scenarios aren't impossible. Solomonoff induction halves the probability of each hypothesis based on how many additional bits it takes to describe. This means the probability of different models decreases fairly rapidly. But not as rapidly as functions like 3^^^3 grow. So there are hypotheses that describe things that are 3^^^3 units large in much fewer than log(3^^^3) bits.
So the utility of hypotheses can grow ...
Summary: the problem with Pascal's Mugging arguments is that, intuitively, some probabilities are just too small to care about. There might be a principled reason for ignoring some probabilities, namely that they violate an implicit assumption behind expected utility theory. This suggests a possible approach for formally defining a "probability small enough to ignore", though there's still a bit of arbitrariness in it.