Frequency of getting selected as a proposer and voting power relate in solidity

Archived Tendermint
1

As per following link, I’ve created proposer selector in solidity for PoS system in Ethereum.

I would like to have your feedback/suggestions on implementation as per tendermint specs.

https://forum.cosmos.network/t/how-are-frequency-of-getting-selected-as-a-proposer-and-voting-power-relate-or-do-they/704

    pragma solidity ^0.4.24;


    contract ValidatorSet {

      struct Validator {
        uint256 stake;
        int256 accumulator;
        address proposer;
      }

      uint256 private sum;
      Validator[] public validators;
      address public currentProposer;

      constructor() public {
        sum = 0;
        currentProposer = address(0);
      }

      function addValidator(uint256 stake, address proposer) public {
        require(stake > 0);
        validators.push(Validator(stake, 0, proposer));
        sum += stake;
      }

      function getProposers() public returns(address) {
        require(validators.length > 0);
        
        for (uint8 i = 0; i < validators.length; i++) {
          validators[i].accumulator += int(validators[i].stake); 
        }
      
      return selectProposer();
      }

      function selectProposer() private returns (address) {
        int256 max = -99999999999999;//  use -ve max
        uint8 index = 0;
        for (uint8 i = 0; i < validators.length; i++) {
          if (max < validators[i].accumulator){
            max = validators[i].accumulator;
            index = i;
          }
        }
        validators[index].accumulator -= int(sum);
        currentProposer = validators[index].proposer;
        return validators[index].proposer;
      }

      // test pilot 
      function getNProposers(uint8 n) public returns (address[]) {
        addValidator(4, address(1));
        addValidator(2, address(2));
        addValidator(2, address(3));
        addValidator(2, address(4));
        address[] memory proposers = new address[](n);

        for (uint8 i = 0; i < n; i++) {
          proposers[i] = getProposers();
        }
        return proposers;
      }
    }

Example:

getNProposers(20); // result -> 0,1,2,3,0,0,1,2,3,0,0,1,2,3,0,0,1,2,3,0
1 Like