He could game the timestamps so his difficulty stays at 1 the whole time and easily produce a longer chain. He'd face several major obstacles. The biggest one is this -- we sometimes say the "longer" hash chain wins because that is true for situations where a difficulty change is not spanned. But for reorganizations that span a difficulty chain, the "stronger" hash chain wins. (That is, the one that we would expect to have taken the most hashes to create.)
Ah, yes. I heard about the time stamp fraud elsewhere, but I don't think I understood it until now. Basically we'd be saying that we started mining in 1970 (or whatever) and that we all the time kept producing one block every ten minutes. Thus, the difficulty wouldn't be adjusted, and no one would be able to see that we had been calculating a block in one second (or whatever).
But then, as you say, if we go through this block chain, we can sum up all the initial zeros in the hashes, and calculate how much processing power it took to create this block chain (the more initial zeros, the more processing power), and use this as a basis for selecting the "correct" block chain, instead of chain length.
Clever! But I guess that is the essense of Satoshi's solution to the Byzatine Generals' Problem anyway, ie. that processing power
is what proves honesty, not some more or less direct derivative of that (the block chain length).
Is this part of the original satoshi white paper? or was this algorithm added?. I am asking about the "the "stronger" hash chain wins. "
Without knowing for certain, I believe this was included in Satoshi's release of his original Bitcoin client. The "processing power wins"-idea is basically the most elemental innovation that Satoshi made in order to make Bitcoin work, and he describes this in the following post:http://email@example.com/msg09997.html
So I'm fairly sure he was acutely aware that it must be proven processing power
that wins, instead of some other factor that relates in some way to proven processing power (block chain length).