Assessing Peer Selection Optimality for Decentralisation

Scope and Goal

Need an approach to measure the optimality of the peer selection algorithm. This is not just about averages (though they are important) but also about distribution.

Literature discusses path length - and that is our starting point that of the Characteristic Path Length [Watts99], but there is a need to understand whether the topography of the final connectivity represents a good enough solution to meet the data diffusion liveness goals needed to ensure that data diffusion does not becomes a significant factor in the chain growth quality.

The goal is to create an assessment tool/regime that:

1. permits us to quantify the liveliness for blocks of a given size in network topographies taken from a realistic network topographies (topographies are topologies which include measures - on their edges - that capture causality/performance issues of interest).