Early approach to gathering referenced documents, processes, procedures in prep for
View the Project on GitHub darrellodonnell/sovrin-controlled-docs
Last Revised: 28JUN2017 (PSTF)
Prior Versions (link):
Establish a transparent and fair process for the collecting and scoring of data. The results of which will be used by an algorithm for deciding which nodes will participate in consensus, based on which ones are likely to add the least risk of network downtime.
Based on an the RBFT: Redundant Byzantine Fault Tolerance paper published at the 2013 IEEE Conference on Distributed Computing Systems, the Sovrin’s Steward Selection Algorithm was captured as a reference implementation in Sovrin Improvement Proposal (SIP 5001).
This algorithm will be implemented using manual analysis as the STF2 goes into effect. Eventually, we imagine establishing software tools and processes to make the selection process automatic.
The selection algorithm requires real data to drive the selection process. The data needs to be harvested and analyzed.
Initially, diversity and performance metrics will be manually gathered by Sovrin Foundation staff. It is the intent of the Sovrin Foundation to formalize both automated push and pull data collection techniques for Validator and Observer nodes as part of STFv3.
The Technical Governance Board in collaboration with the Steward Community will:
performance
ledger .Our selection algorithm operates on scored data. Currently, this scoring process is performed using manual human assessments over the data that is available.
The Technical Governance Board in collaboration with the Steward Community will:
Our selection algorithm is intermittently executed using a pool of available nodes and the performance
ledger as inputs to select the nodes that will comprise the active set.
The frequency of this selection process is currently monthly. Eventually, this should be a very frequent and automated process with selection refreshes as often as every hour.