mirror of
https://gitlab.com/pulsechaincom/prysm-pulse.git
synced 2024-12-28 14:17:17 +00:00
20803b4c9d
* revert using ssz.TreeHash * gazelle
201 lines
5.2 KiB
Go
201 lines
5.2 KiB
Go
package blocks
|
|
|
|
import (
|
|
"bytes"
|
|
"fmt"
|
|
"reflect"
|
|
"testing"
|
|
|
|
"github.com/gogo/protobuf/proto"
|
|
pb "github.com/prysmaticlabs/prysm/proto/beacon/p2p/v1"
|
|
"github.com/prysmaticlabs/prysm/shared/hashutil"
|
|
"github.com/prysmaticlabs/prysm/shared/params"
|
|
)
|
|
|
|
func TestGenesisBlock_InitializedCorrectly(t *testing.T) {
|
|
stateHash := []byte{0}
|
|
b1 := NewGenesisBlock(stateHash)
|
|
|
|
if b1.ParentRootHash32 == nil {
|
|
t.Error("genesis block missing ParentHash field")
|
|
}
|
|
|
|
if !reflect.DeepEqual(b1.Body.Attestations, []*pb.Attestation{}) {
|
|
t.Errorf("genesis block should have 0 attestations")
|
|
}
|
|
|
|
if !bytes.Equal(b1.RandaoReveal, params.BeaconConfig().ZeroHash[:]) {
|
|
t.Error("genesis block missing RandaoReveal field")
|
|
}
|
|
|
|
if !bytes.Equal(b1.StateRootHash32, stateHash) {
|
|
t.Error("genesis block StateRootHash32 isn't initialized correctly")
|
|
}
|
|
expectedEth1 := &pb.Eth1Data{
|
|
DepositRootHash32: params.BeaconConfig().ZeroHash[:],
|
|
BlockHash32: params.BeaconConfig().ZeroHash[:],
|
|
}
|
|
if !proto.Equal(b1.Eth1Data, expectedEth1) {
|
|
t.Error("genesis block Eth1Data isn't initialized correctly")
|
|
}
|
|
}
|
|
|
|
func TestBlockRootAtSlot_AccurateBlockRoot(t *testing.T) {
|
|
if params.BeaconConfig().SlotsPerEpoch != 64 {
|
|
t.Errorf("epochLength should be 64 for these tests to pass")
|
|
}
|
|
var blockRoots [][]byte
|
|
|
|
for i := uint64(0); i < params.BeaconConfig().LatestBlockRootsLength; i++ {
|
|
blockRoots = append(blockRoots, []byte{byte(i)})
|
|
}
|
|
state := &pb.BeaconState{
|
|
LatestBlockRootHash32S: blockRoots,
|
|
}
|
|
|
|
tests := []struct {
|
|
slot uint64
|
|
stateSlot uint64
|
|
expectedRoot []byte
|
|
}{
|
|
{
|
|
slot: 0,
|
|
stateSlot: 1,
|
|
expectedRoot: []byte{0},
|
|
},
|
|
{
|
|
slot: 2,
|
|
stateSlot: 5,
|
|
expectedRoot: []byte{2},
|
|
},
|
|
{
|
|
slot: 64,
|
|
stateSlot: 128,
|
|
expectedRoot: []byte{64},
|
|
}, {
|
|
slot: 2999,
|
|
stateSlot: 3000,
|
|
expectedRoot: []byte{183},
|
|
}, {
|
|
slot: 2873,
|
|
stateSlot: 3000,
|
|
expectedRoot: []byte{57},
|
|
},
|
|
}
|
|
for _, tt := range tests {
|
|
state.Slot = tt.stateSlot + params.BeaconConfig().GenesisSlot
|
|
wantedSlot := tt.slot + params.BeaconConfig().GenesisSlot
|
|
result, err := BlockRoot(state, wantedSlot)
|
|
if err != nil {
|
|
t.Errorf("failed to get block root at slot %d: %v", wantedSlot, err)
|
|
}
|
|
if !bytes.Equal(result, tt.expectedRoot) {
|
|
t.Errorf(
|
|
"result block root was an unexpected value. Wanted %d, got %d",
|
|
tt.expectedRoot,
|
|
result,
|
|
)
|
|
}
|
|
}
|
|
}
|
|
|
|
func TestBlockRootAtSlot_OutOfBounds(t *testing.T) {
|
|
if params.BeaconConfig().SlotsPerEpoch != 64 {
|
|
t.Errorf("epochLength should be 64 for these tests to pass")
|
|
}
|
|
|
|
var blockRoots [][]byte
|
|
|
|
for i := uint64(0); i < params.BeaconConfig().LatestBlockRootsLength; i++ {
|
|
blockRoots = append(blockRoots, []byte{byte(i)})
|
|
}
|
|
state := &pb.BeaconState{
|
|
LatestBlockRootHash32S: blockRoots,
|
|
}
|
|
|
|
tests := []struct {
|
|
slot uint64
|
|
stateSlot uint64
|
|
expectedErr string
|
|
}{
|
|
{
|
|
slot: params.BeaconConfig().GenesisSlot + 1000,
|
|
stateSlot: params.BeaconConfig().GenesisSlot + 500,
|
|
expectedErr: fmt.Sprintf("slot %d is not within expected range of %d to %d",
|
|
1000,
|
|
0,
|
|
500),
|
|
},
|
|
{
|
|
slot: params.BeaconConfig().GenesisSlot + 129,
|
|
stateSlot: params.BeaconConfig().GenesisSlot + 400,
|
|
expectedErr: "slot 129 is not within expected range of 272 to 399",
|
|
},
|
|
}
|
|
for _, tt := range tests {
|
|
state.Slot = tt.stateSlot
|
|
_, err := BlockRoot(state, tt.slot)
|
|
if err != nil && err.Error() != tt.expectedErr {
|
|
t.Errorf("Expected error \"%s\" got \"%v\"", tt.expectedErr, err)
|
|
}
|
|
}
|
|
}
|
|
|
|
func TestProcessBlockRoots_AccurateMerkleTree(t *testing.T) {
|
|
state := &pb.BeaconState{}
|
|
|
|
state.LatestBlockRootHash32S = make([][]byte, params.BeaconConfig().LatestBlockRootsLength)
|
|
state.Slot = params.BeaconConfig().LatestBlockRootsLength + 1
|
|
|
|
testRoot := [32]byte{'a'}
|
|
|
|
newState := ProcessBlockRoots(state, testRoot)
|
|
if !bytes.Equal(newState.LatestBlockRootHash32S[0], testRoot[:]) {
|
|
t.Fatalf("Latest Block root hash not saved."+
|
|
" Supposed to get %#x , but got %#x", testRoot, newState.LatestBlockRootHash32S[0])
|
|
}
|
|
|
|
newState.Slot = newState.Slot - 1
|
|
|
|
newState = ProcessBlockRoots(newState, testRoot)
|
|
expectedHashes := make([][]byte, params.BeaconConfig().LatestBlockRootsLength)
|
|
expectedHashes[0] = testRoot[:]
|
|
expectedHashes[params.BeaconConfig().LatestBlockRootsLength-1] = testRoot[:]
|
|
|
|
expectedRoot := hashutil.MerkleRoot(expectedHashes)
|
|
|
|
if !bytes.Equal(newState.BatchedBlockRootHash32S[0], expectedRoot[:]) {
|
|
t.Errorf("saved merkle root is not equal to expected merkle root"+
|
|
"\n expected %#x but got %#x", expectedRoot, newState.BatchedBlockRootHash32S[0])
|
|
}
|
|
}
|
|
|
|
func TestBlockChildren_Fetches2Children(t *testing.T) {
|
|
genesisBlock := NewGenesisBlock([]byte{})
|
|
genesisRoot, err := hashutil.HashBeaconBlock(genesisBlock)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
targets := []*pb.BeaconBlock{
|
|
{
|
|
Slot: 9,
|
|
ParentRootHash32: genesisRoot[:],
|
|
},
|
|
{
|
|
Slot: 5,
|
|
ParentRootHash32: []byte{},
|
|
},
|
|
{
|
|
Slot: 8,
|
|
ParentRootHash32: genesisRoot[:],
|
|
},
|
|
}
|
|
children, err := BlockChildren(genesisBlock, targets)
|
|
if err != nil {
|
|
t.Fatalf("Could not fetch block children: %v", err)
|
|
}
|
|
if len(children) != 2 {
|
|
t.Errorf("Expected %d children, received %d", 2, len(children))
|
|
}
|
|
}
|