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
|
// Copyright 2018 The dexon-consensus-core Authors
// This file is part of the dexon-consensus-core library.
//
// The dexon-consensus-core 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 dexon-consensus-core 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 dexon-consensus-core library. If not, see
// <http://www.gnu.org/licenses/>.
package core
import (
"testing"
"github.com/stretchr/testify/suite"
"github.com/dexon-foundation/dexon-consensus-core/common"
"github.com/dexon-foundation/dexon-consensus-core/core/crypto/eth"
"github.com/dexon-foundation/dexon-consensus-core/core/types"
)
type LeaderSelectorTestSuite struct {
suite.Suite
}
func (s *LeaderSelectorTestSuite) newLeader() *leaderSelector {
return newGenesisLeaderSelector([]byte("DEXON 🚀"), eth.SigToPub)
}
func (s *LeaderSelectorTestSuite) TestDistance() {
leader := s.newLeader()
hash := common.NewRandomHash()
prv, err := eth.NewPrivateKey()
s.Require().Nil(err)
sig, err := prv.Sign(hash)
s.Require().Nil(err)
dis := leader.distance(sig)
s.True(dis.Cmp(maxHash) == -1)
}
func (s *LeaderSelectorTestSuite) TestProbability() {
leader := s.newLeader()
prv1, err := eth.NewPrivateKey()
s.Require().Nil(err)
prv2, err := eth.NewPrivateKey()
s.Require().Nil(err)
for {
hash := common.NewRandomHash()
sig1, err := prv1.Sign(hash)
s.Require().Nil(err)
sig2, err := prv2.Sign(hash)
s.Require().Nil(err)
dis1 := leader.distance(sig1)
dis2 := leader.distance(sig2)
prob1 := leader.probability(sig1)
prob2 := leader.probability(sig2)
s.True(prob1 <= 1 && prob1 >= 0)
s.True(prob2 <= 1 && prob2 >= 0)
cmp := dis1.Cmp(dis2)
if cmp == 0 {
s.True(dis1.Cmp(dis2) == 0)
continue
}
if cmp == 1 {
s.True(prob2 > prob1)
} else if cmp == -1 {
s.True(prob2 < prob1)
}
break
}
}
func (s *LeaderSelectorTestSuite) TestLeaderBlockHash() {
leader := s.newLeader()
blocks := make(map[common.Hash]*types.Block)
for i := 0; i < 10; i++ {
prv, err := eth.NewPrivateKey()
s.Require().Nil(err)
block := &types.Block{
ProposerID: types.NewNodeID(prv.PublicKey()),
Hash: common.NewRandomHash(),
}
s.Require().Nil(leader.prepareBlock(block, prv))
s.Require().Nil(leader.processBlock(block))
blocks[block.Hash] = block
}
blockHash := leader.leaderBlockHash()
leaderBlock, exist := blocks[blockHash]
s.Require().True(exist)
leaderDist := leader.distance(leaderBlock.CRSSignature)
for _, block := range blocks {
if block == leaderBlock {
continue
}
dist := leader.distance(block.CRSSignature)
s.True(leaderDist.Cmp(dist) == -1)
}
}
func (s *LeaderSelectorTestSuite) TestPrepareBlock() {
leader := s.newLeader()
prv, err := eth.NewPrivateKey()
s.Require().Nil(err)
block := &types.Block{
ProposerID: types.NewNodeID(prv.PublicKey()),
}
s.Require().Nil(leader.prepareBlock(block, prv))
s.Nil(leader.processBlock(block))
block.Position.Height++
s.Error(ErrIncorrectCRSSignature, leader.processBlock(block))
}
func TestLeaderSelector(t *testing.T) {
suite.Run(t, new(LeaderSelectorTestSuite))
}
|
