Algorithm to determine optimal miners in a storage pool

[rishiad]

Input

• Number Pieces
• Number Miners available
• Rank of Miners

[rishiad]

Given that erasure coding provides us with a guarantee that we can recover the file even after a 30% loss of the data pieces. We can use this assign 70% of the pieces (mix of data and parity pieces) to higher ranking miners and 30% of the pieces (only data pieces) to lower ranking miners to allow them to build trust and rank in the network. The validators can come to a consensus about what the threshold is that qualifies a miner to be of higher rank.