mirror/prysm-pulse
1
0
Fork 0
mirror of https://gitlab.com/pulsechaincom/prysm-pulse.git synced 2024-12-24 12:27:18 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Add More Tests to CommitteeAssignments (#6028)

Browse Source 
* add test
* Merge refs/heads/master into comm-tests
* Merge refs/heads/master into comm-tests
* Merge refs/heads/master into comm-tests
* Merge refs/heads/master into comm-tests
* Merge refs/heads/master into comm-tests
* Merge refs/heads/master into comm-tests
* Merge refs/heads/master into comm-tests
* Merge refs/heads/master into comm-tests
* pass comm tests
* Merge branch 'comm-tests' of github.com:prysmaticlabs/prysm into comm-tests
* Merge refs/heads/master into comm-tests
* Merge refs/heads/master into comm-tests
* Merge refs/heads/master into comm-tests
* Merge refs/heads/master into comm-tests
* Merge refs/heads/master into comm-tests
* Merge refs/heads/master into comm-tests
* Merge refs/heads/master into comm-tests
* Merge refs/heads/master into comm-tests
* Merge refs/heads/master into comm-tests
This commit is contained in:
Raul Jordan 2020-06-01 09:50:48 -05:00 committed by GitHub
parent c23ac8547f
commit 31ef6befde
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 66 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

66
beacon-chain/core/helpers/committee_test.go
View File

@ -4,6 +4,7 @@ import (
"fmt"
"reflect"
"strconv"
"strings"
"testing"
ethpb "github.com/prysmaticlabs/ethereumapis/eth/v1alpha1"
@ -193,6 +194,24 @@ func TestVerifyBitfieldLength_OK(t *testing.T) {
}
}
func TestCommitteeAssignments_CannotRetrieveFutureEpoch(t *testing.T) {
ClearCache()
epoch := uint64(1)
state, err := beaconstate.InitializeFromProto(&pb.BeaconState{
Slot: 0, // Epoch 0.
})
if err != nil {
t.Fatal(err)
}
_, _, err = CommitteeAssignments(state, epoch+1)
if err == nil {
t.Fatal("Expected error, received nil")
}
if !strings.Contains(err.Error(), "can't be greater than next epoch") {
t.Errorf("Expected unable to get greater than next epoch, received %v", err)
}
}
func TestCommitteeAssignments_CanRetrieve(t *testing.T) {
// Initialize test with 256 validators, each slot and each index gets 4 validators.
validators := make([]*ethpb.Validator, 4*params.BeaconConfig().SlotsPerEpoch)
@ -283,6 +302,53 @@ func TestCommitteeAssignments_CanRetrieve(t *testing.T) {
}
}
func TestCommitteeAssignments_EverySlotHasMin1Proposer(t *testing.T) {
// Initialize test with 256 validators, each slot and each index gets 4 validators.
validators := make([]*ethpb.Validator, 4*params.BeaconConfig().SlotsPerEpoch)
for i := 0; i < len(validators); i++ {
validators[i] = &ethpb.Validator{
ActivationEpoch: 0,
ExitEpoch: params.BeaconConfig().FarFutureEpoch,
}
}
state, err := beaconstate.InitializeFromProto(&pb.BeaconState{
Validators: validators,
Slot: 2 * params.BeaconConfig().SlotsPerEpoch, // epoch 2
RandaoMixes: make([][]byte, params.BeaconConfig().EpochsPerHistoricalVector),
})
if err != nil {
t.Fatal(err)
}
ClearCache()
epoch := uint64(1)
_, proposerIndexToSlots, err := CommitteeAssignments(state, epoch)
if err != nil {
t.Fatalf("failed to determine CommitteeAssignments: %v", err)
}
slotsWithProposers := make(map[uint64]bool)
for _, proposerSlots := range proposerIndexToSlots {
for _, slot := range proposerSlots {
slotsWithProposers[slot] = true
}
}
if uint64(len(slotsWithProposers)) != params.BeaconConfig().SlotsPerEpoch {
t.Errorf(
"Expected %d slots with proposers, received %d",
params.BeaconConfig().SlotsPerEpoch,
len(slotsWithProposers),
)
}
startSlot := StartSlot(epoch)
endSlot := StartSlot(epoch + 1)
for i := startSlot; i < endSlot; i++ {
hasProposer := slotsWithProposers[i]
if !hasProposer {
t.Errorf("Expected every slot in epoch 1 to have a proposer, slot %d did not", i)
}
}
}
func TestVerifyAttestationBitfieldLengths_OK(t *testing.T) {
validators := make([]*ethpb.Validator, 2*params.BeaconConfig().SlotsPerEpoch)
activeRoots := make([][]byte, params.BeaconConfig().EpochsPerHistoricalVector)