Incorrect. If my SH controls the transactions in the last TBs for that hash, I can caused the hash to have any value I want (at some cost).
That cost is going to be very high. Bitcoin is built around the hardness of this task, only they try to find a partial preimage, while we're talking about finding a full preimage. So if you can choose the seed here, you'll have no trouble killing bitcoin as well. For some hashes this has not been accomplished even once:
https://en.wikipedia.org/wiki/Preimage_attackSo you don't get to choose your seed.
This is silly, it's like saying "I got this encrypted message, so I can decrypt it by enumerating the key. So the encryption is useless." Yes you can, go on.
If you still find it difficult to understand, play a little game: imagine the seed is MD5 hash (that's a "weak" one), and the transactions are written in ascii text. The first transaction says "Transfer 5 decrits from account 1 to 2." You choose the next transaction(s), concatenate them with that string and compute the MD5. Now try to have the result of all zeroes. If you succeed, post your transaction here.
It has deterministic values from every seed. All I have to do is compute from any seed of my choice, target my SH IDs to those values over any length of time that it takes for me to do so. Then just create that hash seed every time one of my SH is last. Thus disruption.
First, the IDs are chosen, and then you know the seed. Not the other way around.
In order to prevent that, I proposed fixing all the seeds completely and not using any "entropy" by your terms. While this complicates the attack significantly, it's still not bulletproof.
Then I only need to target those known patterns. I have as much time as I need to get my SH's IDs into that pattern.
Yes. Still it may be very difficult, but it's safer to use the "random" input.
* he remained secret and covered all his tracks perfectly
On wikipedia there's a passage about some patent application:
http://en.wikipedia.org/wiki/Bitcoin#Satoshi_NakamotoI think these guys are him
