Apr 6, 2024

You could generalise the problem and drive a probability that given n tx hashes you can end up with m combinations where the root hash will be the same. Then knowing the size of unconfirmed transactions you know the probability of existence of malleable block hash. The result could be to say we should strive to keep the number of unconfirmed txs below some N. Maybe we have been accidentally lucky because of the mempool stupidity?