Numbered for ease of replying.
- 1. The five proof of work algorithms are: SHA256d, Scrypt, Skein, Myriad-Groestl, and Qubit.
- 2. Each algorithm has its own independent difficulty.
- 3. Any algorithm can find the next block.
- 4. All the algorithms use the same difficulty adjustment method.
- 5. On average, each algorithm has the same chance of finding the next block.
- 6. Each algorithm aims for a block generation time of 2.5 minutes.
- 7. Over the five algorithms, a block should be found on average every 30 seconds.
- 8. Each of the five algorithms should find 20% of the total blocks over time
1-4 are axiomatic.
5 seems to rely on difficulty adjustment significantly.
Let's assume difficulty adjusts over a sane interval like 1000-2000 blocks.
I haven't seen any sensible algorithms that aren't vulnerable to timewarp attacks and similar; correct me if progress has been made here.
If one algorithm became under-utilized, its individual difficulty would drop.
Assuming that multiple blocks in a row on the same algorithm are possible (see 3); this means that if one algorithm falls out of favour, it doesn't matter how strong the others are.
At diff adjustment, normalized hashpower of each chain would be roughly equivalent.
Call this 1+1+1+1+1 = total nethash is 5.
If an attacker then popped in with 3x the current hashpower on one algo; the situation would look like this:
4+1+1+1+1 = total nethash is 8; attacker owns 4/8; attacker is in monopoly position; attacker can private mine until next diff adj.\
6-7 are irrelevant.
8 seems like a guess that only makes sense immediately after difficulty adjustment assuming no manipulation.