Solomonoff induction halves the probability of each hypothesis based on how many additional bits it takes to describe.
See, I told everyone that people here say this.
Fake muggings with large numbers are more profitable to the mugger than fake muggings with small numbers because the fake mugging with the larger number is more likely to convince a naive rationalist. And the profitability depends on the size of the number, not the number of bits in the number. Which makes the likelihood of a large number being fake grow faster than the number of bits in the number.
You are solving the specific problem of the mugger, and not the general problem of tiny bets with huge rewards.
Regardless, there's no way the probability decreases faster than the reward the mugger promises. I don't think you can assign 1/3^^^3 probability to anything. That's an unfathomably small probability. You are literally saying there is no amount of evidence the mugger could give you to convince you otherwise. Even if he showed you his matrix powers, and the computer simulation of 3^^^3 people, you still wouldn't believe him.
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.