2019-11-13 05:32:42 +00:00
|
|
|
package beacon
|
|
|
|
|
|
|
|
import (
|
|
|
|
"context"
|
2020-01-09 22:45:05 +00:00
|
|
|
"encoding/binary"
|
2019-11-13 05:32:42 +00:00
|
|
|
"reflect"
|
|
|
|
"testing"
|
|
|
|
|
|
|
|
"github.com/gogo/protobuf/proto"
|
2019-11-27 05:08:18 +00:00
|
|
|
ethpb "github.com/prysmaticlabs/ethereumapis/eth/v1alpha1"
|
2019-11-13 05:32:42 +00:00
|
|
|
mock "github.com/prysmaticlabs/prysm/beacon-chain/blockchain/testing"
|
|
|
|
"github.com/prysmaticlabs/prysm/beacon-chain/core/helpers"
|
|
|
|
"github.com/prysmaticlabs/prysm/beacon-chain/db"
|
|
|
|
dbTest "github.com/prysmaticlabs/prysm/beacon-chain/db/testing"
|
|
|
|
pbp2p "github.com/prysmaticlabs/prysm/proto/beacon/p2p/v1"
|
|
|
|
"github.com/prysmaticlabs/prysm/shared/params"
|
|
|
|
)
|
|
|
|
|
2019-12-03 23:44:58 +00:00
|
|
|
func TestServer_ListBeaconCommittees(t *testing.T) {
|
2019-11-13 05:32:42 +00:00
|
|
|
db := dbTest.SetupDB(t)
|
|
|
|
defer dbTest.TeardownDB(t, db)
|
|
|
|
|
|
|
|
numValidators := 128
|
|
|
|
headState := setupActiveValidators(t, db, numValidators)
|
|
|
|
|
|
|
|
headState.RandaoMixes = make([][]byte, params.BeaconConfig().EpochsPerHistoricalVector)
|
|
|
|
for i := 0; i < len(headState.RandaoMixes); i++ {
|
|
|
|
headState.RandaoMixes[i] = make([]byte, 32)
|
|
|
|
}
|
|
|
|
|
|
|
|
bs := &Server{
|
|
|
|
HeadFetcher: &mock.ChainService{
|
|
|
|
State: headState,
|
|
|
|
},
|
|
|
|
}
|
|
|
|
|
|
|
|
activeIndices, err := helpers.ActiveValidatorIndices(headState, 0)
|
|
|
|
if err != nil {
|
|
|
|
t.Fatal(err)
|
|
|
|
}
|
|
|
|
attesterSeed, err := helpers.Seed(headState, 0, params.BeaconConfig().DomainBeaconAttester)
|
|
|
|
if err != nil {
|
|
|
|
t.Fatal(err)
|
|
|
|
}
|
2019-12-03 23:44:58 +00:00
|
|
|
wanted := make(map[uint64]*ethpb.BeaconCommittees_CommitteesList)
|
2019-11-13 05:32:42 +00:00
|
|
|
for slot := uint64(0); slot < params.BeaconConfig().SlotsPerEpoch; slot++ {
|
|
|
|
var countAtSlot = uint64(numValidators) / params.BeaconConfig().SlotsPerEpoch / params.BeaconConfig().TargetCommitteeSize
|
|
|
|
if countAtSlot > params.BeaconConfig().MaxCommitteesPerSlot {
|
|
|
|
countAtSlot = params.BeaconConfig().MaxCommitteesPerSlot
|
|
|
|
}
|
|
|
|
if countAtSlot == 0 {
|
|
|
|
countAtSlot = 1
|
|
|
|
}
|
2019-12-03 23:44:58 +00:00
|
|
|
committeeItems := make([]*ethpb.BeaconCommittees_CommitteeItem, countAtSlot)
|
2019-11-13 05:32:42 +00:00
|
|
|
for i := uint64(0); i < countAtSlot; i++ {
|
|
|
|
epochOffset := i + (slot%params.BeaconConfig().SlotsPerEpoch)*countAtSlot
|
|
|
|
totalCount := countAtSlot * params.BeaconConfig().SlotsPerEpoch
|
|
|
|
committee, err := helpers.ComputeCommittee(activeIndices, attesterSeed, epochOffset, totalCount)
|
|
|
|
if err != nil {
|
|
|
|
t.Fatal(err)
|
|
|
|
}
|
2019-12-03 23:44:58 +00:00
|
|
|
committeeItems[i] = ðpb.BeaconCommittees_CommitteeItem{
|
|
|
|
ValidatorIndices: committee,
|
|
|
|
}
|
|
|
|
}
|
|
|
|
wanted[slot] = ðpb.BeaconCommittees_CommitteesList{
|
|
|
|
Committees: committeeItems,
|
2019-11-13 05:32:42 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
tests := []struct {
|
|
|
|
req *ethpb.ListCommitteesRequest
|
|
|
|
res *ethpb.BeaconCommittees
|
|
|
|
}{
|
|
|
|
{
|
2019-12-03 23:44:58 +00:00
|
|
|
req: ðpb.ListCommitteesRequest{},
|
2019-11-13 05:32:42 +00:00
|
|
|
res: ðpb.BeaconCommittees{
|
|
|
|
Epoch: 0,
|
2019-12-03 23:44:58 +00:00
|
|
|
Committees: wanted,
|
2019-11-13 05:32:42 +00:00
|
|
|
ActiveValidatorCount: uint64(numValidators),
|
|
|
|
},
|
|
|
|
},
|
|
|
|
}
|
|
|
|
for _, test := range tests {
|
|
|
|
res, err := bs.ListBeaconCommittees(context.Background(), test.req)
|
|
|
|
if err != nil {
|
|
|
|
t.Fatal(err)
|
|
|
|
}
|
|
|
|
if !proto.Equal(res, test.res) {
|
|
|
|
t.Errorf("Expected %v, received %v", test.res, res)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func TestServer_ListBeaconCommittees_FromArchive(t *testing.T) {
|
|
|
|
db := dbTest.SetupDB(t)
|
|
|
|
defer dbTest.TeardownDB(t, db)
|
|
|
|
ctx := context.Background()
|
|
|
|
|
|
|
|
numValidators := 128
|
|
|
|
headState := setupActiveValidators(t, db, numValidators)
|
|
|
|
|
|
|
|
headState.RandaoMixes = make([][]byte, params.BeaconConfig().EpochsPerHistoricalVector)
|
|
|
|
for i := 0; i < len(headState.RandaoMixes); i++ {
|
|
|
|
headState.RandaoMixes[i] = make([]byte, 32)
|
|
|
|
}
|
|
|
|
|
|
|
|
headState.Slot = params.BeaconConfig().SlotsPerEpoch * 10
|
|
|
|
|
|
|
|
// Store the genesis seed.
|
|
|
|
seed, err := helpers.Seed(headState, 0, params.BeaconConfig().DomainBeaconAttester)
|
|
|
|
if err != nil {
|
|
|
|
t.Fatal(err)
|
|
|
|
}
|
2019-11-27 05:08:18 +00:00
|
|
|
if err := db.SaveArchivedCommitteeInfo(ctx, 0, &pbp2p.ArchivedCommitteeInfo{
|
2019-11-13 05:32:42 +00:00
|
|
|
AttesterSeed: seed[:],
|
|
|
|
}); err != nil {
|
|
|
|
t.Fatal(err)
|
|
|
|
}
|
|
|
|
|
|
|
|
bs := &Server{
|
|
|
|
BeaconDB: db,
|
|
|
|
HeadFetcher: &mock.ChainService{
|
|
|
|
State: headState,
|
|
|
|
},
|
|
|
|
}
|
|
|
|
|
|
|
|
activeIndices, err := helpers.ActiveValidatorIndices(headState, 0)
|
|
|
|
if err != nil {
|
|
|
|
t.Fatal(err)
|
|
|
|
}
|
2019-12-03 23:44:58 +00:00
|
|
|
wanted := make(map[uint64]*ethpb.BeaconCommittees_CommitteesList)
|
2019-11-13 05:32:42 +00:00
|
|
|
for slot := uint64(0); slot < params.BeaconConfig().SlotsPerEpoch; slot++ {
|
|
|
|
var countAtSlot = uint64(numValidators) / params.BeaconConfig().SlotsPerEpoch / params.BeaconConfig().TargetCommitteeSize
|
|
|
|
if countAtSlot > params.BeaconConfig().MaxCommitteesPerSlot {
|
|
|
|
countAtSlot = params.BeaconConfig().MaxCommitteesPerSlot
|
|
|
|
}
|
|
|
|
if countAtSlot == 0 {
|
|
|
|
countAtSlot = 1
|
|
|
|
}
|
2019-12-03 23:44:58 +00:00
|
|
|
committeeItems := make([]*ethpb.BeaconCommittees_CommitteeItem, countAtSlot)
|
2019-11-13 05:32:42 +00:00
|
|
|
for i := uint64(0); i < countAtSlot; i++ {
|
|
|
|
epochOffset := i + (slot%params.BeaconConfig().SlotsPerEpoch)*countAtSlot
|
|
|
|
totalCount := countAtSlot * params.BeaconConfig().SlotsPerEpoch
|
|
|
|
committee, err := helpers.ComputeCommittee(activeIndices, seed, epochOffset, totalCount)
|
|
|
|
if err != nil {
|
|
|
|
t.Fatal(err)
|
|
|
|
}
|
2019-12-03 23:44:58 +00:00
|
|
|
committeeItems[i] = ðpb.BeaconCommittees_CommitteeItem{
|
|
|
|
ValidatorIndices: committee,
|
|
|
|
}
|
|
|
|
}
|
|
|
|
wanted[slot] = ðpb.BeaconCommittees_CommitteesList{
|
|
|
|
Committees: committeeItems,
|
2019-11-13 05:32:42 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
res1, err := bs.ListBeaconCommittees(context.Background(), ðpb.ListCommitteesRequest{
|
|
|
|
QueryFilter: ðpb.ListCommitteesRequest_Genesis{
|
|
|
|
Genesis: true,
|
|
|
|
},
|
|
|
|
})
|
|
|
|
if err != nil {
|
|
|
|
t.Fatal(err)
|
|
|
|
}
|
|
|
|
res2, err := bs.ListBeaconCommittees(context.Background(), ðpb.ListCommitteesRequest{
|
|
|
|
QueryFilter: ðpb.ListCommitteesRequest_Epoch{
|
|
|
|
Epoch: 0,
|
|
|
|
},
|
|
|
|
})
|
|
|
|
if err != nil {
|
|
|
|
t.Fatal(err)
|
|
|
|
}
|
|
|
|
if !reflect.DeepEqual(res1, res2) {
|
|
|
|
t.Fatal(err)
|
|
|
|
}
|
|
|
|
wantedRes := ðpb.BeaconCommittees{
|
|
|
|
Epoch: 0,
|
|
|
|
Committees: wanted,
|
|
|
|
ActiveValidatorCount: uint64(numValidators),
|
|
|
|
}
|
|
|
|
if !reflect.DeepEqual(wantedRes, res1) {
|
|
|
|
t.Errorf("Wanted %v, received %v", wantedRes, res1)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func setupActiveValidators(t *testing.T, db db.Database, count int) *pbp2p.BeaconState {
|
|
|
|
ctx := context.Background()
|
|
|
|
balances := make([]uint64, count)
|
|
|
|
validators := make([]*ethpb.Validator, 0, count)
|
|
|
|
for i := 0; i < count; i++ {
|
2020-01-09 22:45:05 +00:00
|
|
|
pubKey := make([]byte, params.BeaconConfig().BLSPubkeyLength)
|
|
|
|
binary.LittleEndian.PutUint64(pubKey, uint64(i))
|
|
|
|
if err := db.SaveValidatorIndex(ctx, pubKey, uint64(i)); err != nil {
|
2019-11-13 05:32:42 +00:00
|
|
|
t.Fatal(err)
|
|
|
|
}
|
|
|
|
balances[i] = uint64(i)
|
|
|
|
validators = append(validators, ðpb.Validator{
|
2020-01-09 22:45:05 +00:00
|
|
|
PublicKey: pubKey,
|
2019-11-13 05:32:42 +00:00
|
|
|
ActivationEpoch: 0,
|
|
|
|
ExitEpoch: params.BeaconConfig().FarFutureEpoch,
|
|
|
|
})
|
|
|
|
}
|
|
|
|
return &pbp2p.BeaconState{Validators: validators, Balances: balances}
|
|
|
|
}
|