Sharding capacity/resource specific

[marcus-pousette]

Right now sharding assume that all peers have more or less same capacity for storage (ram, disc, cpu etc). This can be optimized so that we can use powerful peers more than weak ones.

• Make sharding alg. to respect resource capabilities of peers in a meaningful way
• Make sure this does not become an vulnerability for peers as they when/if they share resource information

[marcus-pousette]

Idea:

f ( resources ) -> R^1 

Scale slots with f, so that in the leader election routing, it is more probable to become a leader if you have more resources.

Resource data is shared "when changed" or "when peers connect"

[marcus-pousette]

Network would reach appx census about f, i.e. there would be a deterministic way computational resources ( vector of numbers ) can be translated result in slot width (a number), so that peers will little capacity would be given less responsibility, and more -> more

[marcus-pousette]

i.e.

f: R^n -> R^1

where n is the amount of capacity features.

In the future we can make "f" adaptive to the task at hand. "f" for a high compute, low storage, program would not be the same as for a high storage , low compute, program