Methods to find BTC addresses collisions with less complexity approaches/attemps

[Bitcoin]

Methods to find BTC addresses collisions with less complexity approaches/attemps

I have one question. I'm trying to lower complexity when breaking private keys for BTC.

If we have that an address is a hash160 from priv key, then we can assume that we have 2^96 per each address.

If we have, let's say, 10M of active wallets (~2^23.25). Then, 160-23.25=136.75 we can assume that wallets are uniformly distributed on 2^136.75 gaps.

If we start to find those wallets from those assumptions, can it work well?

I mean, supposedly this distribution should follow the Gaussian function, or am I wrong?

Which methods else do I have to lower complexity?

Why does this guy say 2^80? https://bitcoin.stackexchange.com/a/83819/131965 can somebody explain?

Source: Methods to find BTC addresses collisions with less complexity approaches/attemps