One more question regarding collisions

[satscraper]

If it's about address collision, they wouldn't only search within a limited private key range that's quite possible to bruteforce.

If one has, let's say, 10 pigeons  sitting in 9 cages  he may  search withing a limited number of pigeons (let's say at least 2) sitting in one cage.

The same is true  with the search within a limited private key range.

They still have a chance to find the key collision when  searching "within a limited private key range".

[1714757156]

1714757156

[1714757156]

1714757156

[1714757156]

1714757156

[1714757156]

1714757156

[1714757156]

1714757156

[satashi_nokamato]

There are about 2**160 pigeons sitting in approximately 2**256-32 cages, theoretically for every original pigeon there are 2**96 clones. The question is, how many images of pigeons can you hold in your hand while searching, and how many cages per second can you search?

And when you are doing the search, you will have to compare each cage's content with all of your images(address or RMD-160 hash), which takes us back to the old problem of computationally difficult to do.
If LBC pool has anything to say, they can say it by solving puzzle 66.

[satscraper]

There are about 2**160 pigeons sitting in approximately 2**256-32 cages,

You have mixed the stuff.

In my analogy  pigeons correspond to  keys , while cages - to addresses.