mirror of
https://gitlab.com/pulsechaincom/prysm-pulse.git
synced 2024-12-25 12:57:18 +00:00
0b9212c685
* Revert "Optimize `AppendValidator` for beacon state (#6659)"
This reverts commit c41e382255
.
* Test. H/t to @prestonvanloon
* Merge branch 'master' of github.com:prysmaticlabs/prysm into revert-6659-deposit
* Merge branch 'master' into revert-6659-deposit
268 lines
7.0 KiB
Go
268 lines
7.0 KiB
Go
package state_test
|
|
|
|
import (
|
|
"bytes"
|
|
"context"
|
|
"testing"
|
|
|
|
eth "github.com/prysmaticlabs/ethereumapis/eth/v1alpha1"
|
|
"github.com/prysmaticlabs/go-ssz"
|
|
"github.com/prysmaticlabs/prysm/beacon-chain/state"
|
|
pbp2p "github.com/prysmaticlabs/prysm/proto/beacon/p2p/v1"
|
|
"github.com/prysmaticlabs/prysm/shared/bytesutil"
|
|
"github.com/prysmaticlabs/prysm/shared/params"
|
|
"github.com/prysmaticlabs/prysm/shared/testutil"
|
|
"github.com/prysmaticlabs/prysm/shared/testutil/assert"
|
|
)
|
|
|
|
func TestInitializeFromProto(t *testing.T) {
|
|
testState, _ := testutil.DeterministicGenesisState(t, 64)
|
|
|
|
type test struct {
|
|
name string
|
|
state *pbp2p.BeaconState
|
|
error string
|
|
}
|
|
initTests := []test{
|
|
{
|
|
name: "nil state",
|
|
state: nil,
|
|
error: "received nil state",
|
|
},
|
|
{
|
|
name: "nil validators",
|
|
state: &pbp2p.BeaconState{
|
|
Slot: 4,
|
|
Validators: nil,
|
|
},
|
|
error: "",
|
|
},
|
|
{
|
|
name: "empty state",
|
|
state: &pbp2p.BeaconState{},
|
|
error: "",
|
|
},
|
|
{
|
|
name: "full state",
|
|
state: testState.InnerStateUnsafe(),
|
|
error: "",
|
|
},
|
|
}
|
|
for _, tt := range initTests {
|
|
t.Run(tt.name, func(t *testing.T) {
|
|
_, err := state.InitializeFromProto(tt.state)
|
|
if err != nil && err.Error() != tt.error {
|
|
t.Errorf("Unexpected error, expected %v, recevied %v", tt.error, err)
|
|
}
|
|
if err == nil && tt.error != "" {
|
|
t.Errorf("Expected error, expected %v, recevied %v", tt.error, err)
|
|
}
|
|
})
|
|
}
|
|
}
|
|
|
|
func TestInitializeFromProtoUnsafe(t *testing.T) {
|
|
testState, _ := testutil.DeterministicGenesisState(t, 64)
|
|
|
|
type test struct {
|
|
name string
|
|
state *pbp2p.BeaconState
|
|
error string
|
|
}
|
|
initTests := []test{
|
|
{
|
|
name: "nil state",
|
|
state: nil,
|
|
error: "received nil state",
|
|
},
|
|
{
|
|
name: "nil validators",
|
|
state: &pbp2p.BeaconState{
|
|
Slot: 4,
|
|
Validators: nil,
|
|
},
|
|
error: "",
|
|
},
|
|
{
|
|
name: "empty state",
|
|
state: &pbp2p.BeaconState{},
|
|
error: "",
|
|
},
|
|
{
|
|
name: "full state",
|
|
state: testState.InnerStateUnsafe(),
|
|
error: "",
|
|
},
|
|
}
|
|
for _, tt := range initTests {
|
|
t.Run(tt.name, func(t *testing.T) {
|
|
_, err := state.InitializeFromProtoUnsafe(tt.state)
|
|
if err != nil && err.Error() != tt.error {
|
|
t.Errorf("Unexpected error, expected %v, recevied %v", tt.error, err)
|
|
}
|
|
if err == nil && tt.error != "" {
|
|
t.Errorf("Expected error, expected %v, recevied %v", tt.error, err)
|
|
}
|
|
})
|
|
}
|
|
}
|
|
|
|
func TestBeaconState_HashTreeRoot(t *testing.T) {
|
|
testState, _ := testutil.DeterministicGenesisState(t, 64)
|
|
|
|
type test struct {
|
|
name string
|
|
stateModify func(*state.BeaconState) (*state.BeaconState, error)
|
|
error string
|
|
}
|
|
initTests := []test{
|
|
{
|
|
name: "unchanged state",
|
|
stateModify: func(beaconState *state.BeaconState) (*state.BeaconState, error) {
|
|
return beaconState, nil
|
|
},
|
|
error: "",
|
|
},
|
|
{
|
|
name: "different slot",
|
|
stateModify: func(beaconState *state.BeaconState) (*state.BeaconState, error) {
|
|
if err := beaconState.SetSlot(5); err != nil {
|
|
return nil, err
|
|
}
|
|
return beaconState, nil
|
|
},
|
|
error: "",
|
|
},
|
|
{
|
|
name: "different validator balance",
|
|
stateModify: func(beaconState *state.BeaconState) (*state.BeaconState, error) {
|
|
val, err := beaconState.ValidatorAtIndex(5)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
val.EffectiveBalance = params.BeaconConfig().MaxEffectiveBalance - params.BeaconConfig().EffectiveBalanceIncrement
|
|
if err := beaconState.UpdateValidatorAtIndex(5, val); err != nil {
|
|
return nil, err
|
|
}
|
|
return beaconState, nil
|
|
},
|
|
error: "",
|
|
},
|
|
}
|
|
|
|
var err error
|
|
var oldHTR []byte
|
|
for _, tt := range initTests {
|
|
t.Run(tt.name, func(t *testing.T) {
|
|
testState, err = tt.stateModify(testState)
|
|
assert.NoError(t, err)
|
|
root, err := testState.HashTreeRoot(context.Background())
|
|
if err == nil && tt.error != "" {
|
|
t.Errorf("Expected error, expected %v, recevied %v", tt.error, err)
|
|
}
|
|
genericHTR, err := ssz.HashTreeRoot(testState.InnerStateUnsafe())
|
|
if err == nil && tt.error != "" {
|
|
t.Errorf("Expected error, expected %v, recevied %v", tt.error, err)
|
|
}
|
|
if bytes.Equal(root[:], []byte{}) {
|
|
t.Error("Received empty hash tree root")
|
|
}
|
|
if !bytes.Equal(root[:], genericHTR[:]) {
|
|
t.Error("Expected hash tree root to match generic")
|
|
}
|
|
if len(oldHTR) != 0 && bytes.Equal(root[:], oldHTR) {
|
|
t.Errorf("Expected HTR to change, received %#x == old %#x", root, oldHTR)
|
|
}
|
|
oldHTR = root[:]
|
|
})
|
|
}
|
|
}
|
|
|
|
func TestBeaconState_HashTreeRoot_FieldTrie(t *testing.T) {
|
|
testState, _ := testutil.DeterministicGenesisState(t, 64)
|
|
|
|
type test struct {
|
|
name string
|
|
stateModify func(*state.BeaconState) (*state.BeaconState, error)
|
|
error string
|
|
}
|
|
initTests := []test{
|
|
{
|
|
name: "unchanged state",
|
|
stateModify: func(beaconState *state.BeaconState) (*state.BeaconState, error) {
|
|
return beaconState, nil
|
|
},
|
|
error: "",
|
|
},
|
|
{
|
|
name: "different slot",
|
|
stateModify: func(beaconState *state.BeaconState) (*state.BeaconState, error) {
|
|
if err := beaconState.SetSlot(5); err != nil {
|
|
return nil, err
|
|
}
|
|
return beaconState, nil
|
|
},
|
|
error: "",
|
|
},
|
|
{
|
|
name: "different validator balance",
|
|
stateModify: func(beaconState *state.BeaconState) (*state.BeaconState, error) {
|
|
val, err := beaconState.ValidatorAtIndex(5)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
val.EffectiveBalance = params.BeaconConfig().MaxEffectiveBalance - params.BeaconConfig().EffectiveBalanceIncrement
|
|
if err := beaconState.UpdateValidatorAtIndex(5, val); err != nil {
|
|
return nil, err
|
|
}
|
|
return beaconState, nil
|
|
},
|
|
error: "",
|
|
},
|
|
}
|
|
|
|
var err error
|
|
var oldHTR []byte
|
|
for _, tt := range initTests {
|
|
t.Run(tt.name, func(t *testing.T) {
|
|
testState, err = tt.stateModify(testState)
|
|
assert.NoError(t, err)
|
|
root, err := testState.HashTreeRoot(context.Background())
|
|
if err == nil && tt.error != "" {
|
|
t.Errorf("Expected error, expected %v, recevied %v", tt.error, err)
|
|
}
|
|
genericHTR, err := ssz.HashTreeRoot(testState.InnerStateUnsafe())
|
|
if err == nil && tt.error != "" {
|
|
t.Errorf("Expected error, expected %v, recevied %v", tt.error, err)
|
|
}
|
|
if bytes.Equal(root[:], []byte{}) {
|
|
t.Error("Received empty hash tree root")
|
|
}
|
|
if !bytes.Equal(root[:], genericHTR[:]) {
|
|
t.Error("Expected hash tree root to match generic")
|
|
}
|
|
if len(oldHTR) != 0 && bytes.Equal(root[:], oldHTR) {
|
|
t.Errorf("Expected HTR to change, received %#x == old %#x", root, oldHTR)
|
|
}
|
|
oldHTR = root[:]
|
|
})
|
|
}
|
|
}
|
|
|
|
func TestBeaconState_AppendValidator_DoesntMutateCopy(t *testing.T) {
|
|
st0 := testutil.NewBeaconState()
|
|
st1 := st0.Copy()
|
|
originalCount := st1.NumValidators()
|
|
|
|
val := ð.Validator{Slashed: true}
|
|
if err := st0.AppendValidator(val); err != nil {
|
|
t.Error(err)
|
|
}
|
|
if count := st1.NumValidators(); count != originalCount {
|
|
t.Errorf("st1 NumValidators mutated. Wanted %d, got %d", originalCount, count)
|
|
}
|
|
if _, ok := st1.ValidatorIndexByPubkey(bytesutil.ToBytes48(val.PublicKey)); ok {
|
|
t.Error("Expected no validator index to be present in st1 for the newly inserted pubkey")
|
|
}
|
|
}
|