code: func (vs *Set) MaxFlow() *big.Int {
  	max := vs.TotalPower()
  	return max.Sub(max.Div(max, big3), big1)
  }
docs: // Returns the maximum allowable flow whilst ensuring the majority of validators are non-byzantine after the transition
  // So need at most ceiling((Total Power)/3) - 1, in integer division we have ceiling(X*p/q) = (p(X+1)-1)/q
  // For p = 1 just X/q so we want (Total Power)/3 - 1