Quote from: hawas on October 29, 2013, 11:15:26 PM

@porcupine87

We can make some calculations

let's see, I don't know the hash size, but say it is 256 bits, i.e. ~10^25 possible numbers.
You need aprox. 100 bytes to store a prime origin, so if you have 100TB of space, you can store up to 10^12 chains, disregarding how many years you need to find them, we will assume you already have them stored for now.

Now the chance that you have a good chain for a particular block(hash) is 10^12/10^25 = 10^-13
That's it, you will hit a suitable one every 10 trillion blocks!

Now on the time needed to calculate those chains, well if you somehow manage to get 1 million chains/day, you will need 1 million days, ~3000 years.

So, well...

Ah I think I get it now. So when you try to find a chain, you start with the hash. Let's assume the hash is 100. So then you try 200 as prime origin. If it doesn't work, you try 300. Or maybe you start with 234*100. You always start with a prime origin which can be divided by the hash.

Because now I did some calculations, too. My fallacy was that I thought there are so many big numbers which can be divided by the hash. But now I realize, it is only every 2^256th number. And that is not much...

Ok, thank you guys Wink

But that is good news for me, because if I was right this would be a problem.