Hello, I would like to know if it is possible to start from a specific private key, for example: 'KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjgd9M7rFU73sVHnoWn', which corresponds to '0000000000000000000000000000000000000000000000000000000000000001', and therefore from the associated ripemd160 prefix '751e76e8199196d454941c45d1b3a323f1433bd6', to search for a collision starting from this point.
Thank you very much.
We all know there are collisions, but so far no one has found one and is the same for sha256, there must be multiple collisions but if you try to find an example you will not find one, and if I'm not wrong there is a budget for the one who can find a collision, i don't remember where i read this, it was some time ago.
The problem about the collisions is how big the number of possible combinations are, we are dealing with a 1 followed by 256 ceros, so, we don't have the technology to deal with that kind of numbers yet.