Sun Jun 05, 2016 11:28 pm
Thank you for your comments.
RE: first observation:
You are right. Even if 99.99% of the time hashes are thrown away, they are necessary for "proof-of-work". You will find the following in my document:
"The work of a miner processor essentially consists in:
- collecting, verifying and assembling transactions into a block, and
- using hashing techniques to assemble a “proof-of-work”, by looking for the shortest hash of the block.
While the first is “useful work”, the second is necessary and very expensive, but largely fruitless work. It was devised to deter malicious attacks by making this task very difficult to compute. However, many Kilowatts/hour are spent globally to accomplish this task."
RE: attacks by multiple coordinated identities:
To be part of the "Privileged group" you must have created a previous block and solved the block hash within the last N "open blocks" WHEN ALL MINERS ARE COMPETING. A group of malicious attackers would have to have solved a majority of the last N "open blocks".
In the document I stated:
"The probability of being able to claim membership in the selected group is the same for all miners, since all miners have an equal probability (factoring in the processor speed) to make a block and provide proof-of-work.
The probability (m/M)s of “m” malicious attackers out of the total “M” malicious attackers being members of the selected group, is the same as “Mt”, the probability of “M” malicious attackers in the total group of miners.
Thus, in a privileged group above a practical minimum, the probability of a successful malicious attack by a group of malicious attackers is the same as for the total group of miners in current implementations."
In other words, winning the majority of the last N "open blocks" is as difficult as winning the majority of the last X blocks in current implementations, which would result in a successful malicious group attack.