Topic: Dormant Bitcoin Address Mining Homemade Way - page 2. (Read 557 times)

Yes, collision addresses. like Large Bitcoin Collider Project.

Ins't about profit, but about luck. You are correct, mining is more efective and profitable.

While the addresses technically has the SHA256 hashing during the generation, the speed isn't measured by the hash but rather by the number of keys it generates.

Zero. By the logic of birthday paradox, the least number of addresses you have to generate is 3.65x10^47 out of 1.46x10^48. Even if you can generate 7.92x10^28 of the keys, you are unlikely to find any keys that has actually been used before. No matter how powerful your computer(s) is, you are unlikely to even generate 1% of the total keys that can be generated (2^256).

Assuming that the keys were generated with sufficient randomness.

The probability of success is 0.

the biggest reason is that there is a competing endeavor, which also started searching from 0.
So basically you are searching through the exact same addresses that LBC (Large Bitcoin Collider) has already gone through. And you are a lot slower too.
Here is a link: https://lbc.cryptoguru.org/about

Sounds like a fun project  I wont discourage you more.

If I understand correctly you are trying to find a collision address.

I think if you had the processing power necessary to brute force in this manner and find a collision, it would be many many times more profitable for you to mine bitcoins than to try to hack it.

Hi there

I'm started today to put my self concept of dormant address mining on the way. 

After search for some solutions (like vanitygen), I realized that all existant tools are very slow to do what I want.
Vanitygen for example tests something like 30Mh/s (depend on your hardware), but realize that this speed is just to test "vanity addresses" against a match. when you try to generate random addresses, the speed falls to something like 200kh/s (Already tested the variants like Vanity Plus or Super Vanity Gen).

Another challenge is to test all that generated addresses to find some with balance. 

Actually with some dirt and quick self solutions I can Generate and test 1 Million of addresses per minute against a 42k dormant address database, and optionaly I have one huge file (~1 Gb) with +20 Millions Addresses with some balance (random balances from 1 sat or more ).

I started today and left it on a (free) online server to run 24/7/365. 
Another point is that I don't generate random keys, I'm generating sequential from one to 2^96.
At the time of this post I've generated and tested out of 2.071.000.000 key pairs.

My question is what the chances to find one match ? (Yes, I know that exists 2^160 possible addresses), I just want to know the probality, and maybe turns it an online project to use more powerfull processing power (pool).

Sorry for any typos/bad english

Some clarification and tips are welcome.