-
Notifications
You must be signed in to change notification settings - Fork 189
/
validator.go
141 lines (120 loc) · 4.92 KB
/
validator.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
// Modifications Copyright 2018 The klaytn Authors
// Copyright 2017 The go-ethereum Authors
// This file is part of the go-ethereum library.
//
// The go-ethereum library is free software: you can redistribute it and/or modify
// it under the terms of the GNU Lesser General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// The go-ethereum library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public License
// along with the go-ethereum library. If not, see <http://www.gnu.org/licenses/>.
//
// This file is derived from quorum/consensus/istanbul/validator/validator.go (2018/06/04).
// Modified and improved for the klaytn development.
package validator
import (
"math/rand"
"strconv"
"strings"
"github.com/klaytn/klaytn/common"
"github.com/klaytn/klaytn/consensus"
"github.com/klaytn/klaytn/consensus/istanbul"
"github.com/klaytn/klaytn/log"
)
var logger = log.NewModuleLogger(log.ConsensusIstanbulValidator)
func New(addr common.Address) istanbul.Validator {
return &defaultValidator{
address: addr,
}
}
func NewValidatorSet(addrs, demotedAddrs []common.Address, proposerPolicy istanbul.ProposerPolicy, subGroupSize uint64, chain consensus.ChainReader) istanbul.ValidatorSet {
var valSet istanbul.ValidatorSet
if proposerPolicy == istanbul.WeightedRandom {
valSet = NewWeightedCouncil(addrs, demotedAddrs, nil, nil, nil, proposerPolicy, subGroupSize, 0, 0, chain)
} else {
valSet = NewSubSet(addrs, proposerPolicy, subGroupSize)
}
return valSet
}
func NewSet(addrs []common.Address, policy istanbul.ProposerPolicy) istanbul.ValidatorSet {
return newDefaultSet(addrs, policy)
}
func NewSubSet(addrs []common.Address, policy istanbul.ProposerPolicy, subSize uint64) istanbul.ValidatorSet {
return newDefaultSubSet(addrs, policy, subSize)
}
func ExtractValidators(extraData []byte) []common.Address {
// get the validator addresses
addrs := make([]common.Address, (len(extraData) / common.AddressLength))
for i := 0; i < len(addrs); i++ {
copy(addrs[i][:], extraData[i*common.AddressLength:])
}
return addrs
}
// ConvertHashToSeed returns a random seed used to calculate proposer.
// It converts first 7.5 bytes of the given hash to int64.
func ConvertHashToSeed(hash common.Hash) (int64, error) {
// TODO-Klaytn-Istanbul: convert hash.Hex() to int64 directly without string conversion
hashstring := strings.TrimPrefix(hash.Hex(), "0x")
if len(hashstring) > 15 {
hashstring = hashstring[:15]
}
seed, err := strconv.ParseInt(hashstring, 16, 64)
if err != nil {
logger.Error("fail to make sub-list of validators", "hash", hash.Hex(), "seed", seed, "err", err)
return 0, err
}
return seed, nil
}
// SelectRandomCommittee composes a committee selecting validators randomly based on the seed value.
// It returns nil if the given committeeSize is bigger than validatorSize or proposer indexes are invalid.
func SelectRandomCommittee(validators []istanbul.Validator, committeeSize uint64, seed int64, proposerIdx int, nextProposerIdx int) []istanbul.Validator {
// ensure validator indexes are valid
if proposerIdx < 0 || nextProposerIdx < 0 || proposerIdx == nextProposerIdx {
logger.Error("invalid indexes of validators", "proposerIdx", proposerIdx, "nextProposerIdx", nextProposerIdx)
return nil
}
// ensure committeeSize and proposer indexes are valid
validatorSize := len(validators)
if validatorSize < int(committeeSize) || validatorSize <= proposerIdx || validatorSize <= nextProposerIdx {
logger.Error("invalid committee size or validator indexes", "validatorSize", validatorSize,
"committeeSize", committeeSize, "proposerIdx", proposerIdx, "nextProposerIdx", nextProposerIdx)
return nil
}
// it cannot be happened. just to make sure
if committeeSize < 2 {
if committeeSize == 0 {
logger.Error("committee size has an invalid value", "committeeSize", committeeSize)
return nil
}
return []istanbul.Validator{validators[proposerIdx]}
}
// first committee is the proposer and the second committee is the next proposer
committee := make([]istanbul.Validator, committeeSize)
committee[0] = validators[proposerIdx]
committee[1] = validators[nextProposerIdx]
// select the reset of committee members randomly
picker := rand.New(rand.NewSource(seed))
pickSize := validatorSize - 2
indexs := make([]int, pickSize)
idx := 0
for i := 0; i < validatorSize; i++ {
if i != proposerIdx && i != nextProposerIdx {
indexs[idx] = i
idx++
}
}
for i := 0; i < pickSize; i++ {
randIndex := picker.Intn(pickSize)
indexs[i], indexs[randIndex] = indexs[randIndex], indexs[i]
}
for i := uint64(0); i < committeeSize-2; i++ {
committee[i+2] = validators[indexs[i]]
}
return committee
}