mirror of
https://gitlab.com/pulsechaincom/prysm-pulse.git
synced 2024-12-26 05:17:22 +00:00
4bf935928b
* Use config length 32 * Add root length to minimal * Fix build * Gaz
251 lines
9.0 KiB
Go
251 lines
9.0 KiB
Go
package kv
|
|
|
|
import (
|
|
"context"
|
|
"testing"
|
|
|
|
types "github.com/prysmaticlabs/eth2-types"
|
|
fieldparams "github.com/prysmaticlabs/prysm/config/fieldparams"
|
|
"github.com/prysmaticlabs/prysm/config/params"
|
|
"github.com/prysmaticlabs/prysm/encoding/bytesutil"
|
|
ethpb "github.com/prysmaticlabs/prysm/proto/prysm/v1alpha1"
|
|
"github.com/prysmaticlabs/prysm/proto/prysm/v1alpha1/block"
|
|
"github.com/prysmaticlabs/prysm/proto/prysm/v1alpha1/wrapper"
|
|
"github.com/prysmaticlabs/prysm/testing/assert"
|
|
"github.com/prysmaticlabs/prysm/testing/require"
|
|
"github.com/prysmaticlabs/prysm/testing/util"
|
|
)
|
|
|
|
var genesisBlockRoot = bytesutil.ToBytes32([]byte{'G', 'E', 'N', 'E', 'S', 'I', 'S'})
|
|
|
|
func TestStore_IsFinalizedBlock(t *testing.T) {
|
|
slotsPerEpoch := uint64(params.BeaconConfig().SlotsPerEpoch)
|
|
db := setupDB(t)
|
|
ctx := context.Background()
|
|
|
|
require.NoError(t, db.SaveGenesisBlockRoot(ctx, genesisBlockRoot))
|
|
|
|
blks := makeBlocks(t, 0, slotsPerEpoch*3, genesisBlockRoot)
|
|
require.NoError(t, db.SaveBlocks(ctx, blks))
|
|
|
|
root, err := blks[slotsPerEpoch].Block().HashTreeRoot()
|
|
require.NoError(t, err)
|
|
|
|
cp := ðpb.Checkpoint{
|
|
Epoch: 1,
|
|
Root: root[:],
|
|
}
|
|
|
|
st, err := util.NewBeaconState()
|
|
require.NoError(t, err)
|
|
// a state is required to save checkpoint
|
|
require.NoError(t, db.SaveState(ctx, st, root))
|
|
require.NoError(t, db.SaveFinalizedCheckpoint(ctx, cp))
|
|
|
|
// All blocks up to slotsPerEpoch*2 should be in the finalized index.
|
|
for i := uint64(0); i < slotsPerEpoch*2; i++ {
|
|
root, err := blks[i].Block().HashTreeRoot()
|
|
require.NoError(t, err)
|
|
assert.Equal(t, true, db.IsFinalizedBlock(ctx, root), "Block at index %d was not considered finalized in the index", i)
|
|
}
|
|
for i := slotsPerEpoch * 3; i < uint64(len(blks)); i++ {
|
|
root, err := blks[i].Block().HashTreeRoot()
|
|
require.NoError(t, err)
|
|
assert.Equal(t, false, db.IsFinalizedBlock(ctx, root), "Block at index %d was considered finalized in the index, but should not have", i)
|
|
}
|
|
}
|
|
|
|
func TestStore_IsFinalizedBlockGenesis(t *testing.T) {
|
|
db := setupDB(t)
|
|
ctx := context.Background()
|
|
|
|
blk := util.NewBeaconBlock()
|
|
blk.Block.Slot = 0
|
|
root, err := blk.Block.HashTreeRoot()
|
|
require.NoError(t, err)
|
|
require.NoError(t, db.SaveBlock(ctx, wrapper.WrappedPhase0SignedBeaconBlock(blk)))
|
|
require.NoError(t, db.SaveGenesisBlockRoot(ctx, root))
|
|
assert.Equal(t, true, db.IsFinalizedBlock(ctx, root), "Finalized genesis block doesn't exist in db")
|
|
}
|
|
|
|
// This test scenario is to test a specific edge case where the finalized block root is not part of
|
|
// the finalized and canonical chain.
|
|
//
|
|
// Example:
|
|
// 0 1 2 3 4 5 6 slot
|
|
// a <- b <-- d <- e <- f <- g roots
|
|
// ^- c
|
|
// Imagine that epochs are 2 slots and that epoch 1, 2, and 3 are finalized. Checkpoint roots would
|
|
// be c, e, and g. In this scenario, c was a finalized checkpoint root but no block built upon it so
|
|
// it should not be considered "final and canonical" in the view at slot 6.
|
|
func TestStore_IsFinalized_ForkEdgeCase(t *testing.T) {
|
|
slotsPerEpoch := uint64(params.BeaconConfig().SlotsPerEpoch)
|
|
blocks0 := makeBlocks(t, slotsPerEpoch*0, slotsPerEpoch, genesisBlockRoot)
|
|
blocks1 := append(
|
|
makeBlocks(t, slotsPerEpoch*1, 1, bytesutil.ToBytes32(sszRootOrDie(t, blocks0[len(blocks0)-1]))), // No block builds off of the first block in epoch.
|
|
makeBlocks(t, slotsPerEpoch*1+1, slotsPerEpoch-1, bytesutil.ToBytes32(sszRootOrDie(t, blocks0[len(blocks0)-1])))...,
|
|
)
|
|
blocks2 := makeBlocks(t, slotsPerEpoch*2, slotsPerEpoch, bytesutil.ToBytes32(sszRootOrDie(t, blocks1[len(blocks1)-1])))
|
|
|
|
db := setupDB(t)
|
|
ctx := context.Background()
|
|
|
|
require.NoError(t, db.SaveGenesisBlockRoot(ctx, genesisBlockRoot))
|
|
require.NoError(t, db.SaveBlocks(ctx, blocks0))
|
|
require.NoError(t, db.SaveBlocks(ctx, blocks1))
|
|
require.NoError(t, db.SaveBlocks(ctx, blocks2))
|
|
|
|
// First checkpoint
|
|
checkpoint1 := ðpb.Checkpoint{
|
|
Root: sszRootOrDie(t, blocks1[0]),
|
|
Epoch: 1,
|
|
}
|
|
|
|
st, err := util.NewBeaconState()
|
|
require.NoError(t, err)
|
|
// A state is required to save checkpoint
|
|
require.NoError(t, db.SaveState(ctx, st, bytesutil.ToBytes32(checkpoint1.Root)))
|
|
require.NoError(t, db.SaveFinalizedCheckpoint(ctx, checkpoint1))
|
|
// All blocks in blocks0 and blocks1 should be finalized and canonical.
|
|
for i, block := range append(blocks0, blocks1...) {
|
|
root := sszRootOrDie(t, block)
|
|
assert.Equal(t, true, db.IsFinalizedBlock(ctx, bytesutil.ToBytes32(root)), "%d - Expected block %#x to be finalized", i, root)
|
|
}
|
|
|
|
// Second checkpoint
|
|
checkpoint2 := ðpb.Checkpoint{
|
|
Root: sszRootOrDie(t, blocks2[0]),
|
|
Epoch: 2,
|
|
}
|
|
// A state is required to save checkpoint
|
|
require.NoError(t, db.SaveState(ctx, st, bytesutil.ToBytes32(checkpoint2.Root)))
|
|
require.NoError(t, db.SaveFinalizedCheckpoint(ctx, checkpoint2))
|
|
// All blocks in blocks0 and blocks2 should be finalized and canonical.
|
|
for i, block := range append(blocks0, blocks2...) {
|
|
root := sszRootOrDie(t, block)
|
|
assert.Equal(t, true, db.IsFinalizedBlock(ctx, bytesutil.ToBytes32(root)), "%d - Expected block %#x to be finalized", i, root)
|
|
}
|
|
// All blocks in blocks1 should be finalized and canonical, except blocks1[0].
|
|
for i, block := range blocks1 {
|
|
root := sszRootOrDie(t, block)
|
|
if db.IsFinalizedBlock(ctx, bytesutil.ToBytes32(root)) == (i == 0) {
|
|
t.Errorf("Expected db.IsFinalizedBlock(ctx, blocks1[%d]) to be %v", i, i != 0)
|
|
}
|
|
}
|
|
}
|
|
|
|
func TestStore_IsFinalizedChildBlock(t *testing.T) {
|
|
slotsPerEpoch := uint64(params.BeaconConfig().SlotsPerEpoch)
|
|
db := setupDB(t)
|
|
ctx := context.Background()
|
|
|
|
require.NoError(t, db.SaveGenesisBlockRoot(ctx, genesisBlockRoot))
|
|
|
|
blks := makeBlocks(t, 0, slotsPerEpoch*3, genesisBlockRoot)
|
|
|
|
require.NoError(t, db.SaveBlocks(ctx, blks))
|
|
root, err := blks[slotsPerEpoch].Block().HashTreeRoot()
|
|
require.NoError(t, err)
|
|
|
|
cp := ðpb.Checkpoint{
|
|
Epoch: 1,
|
|
Root: root[:],
|
|
}
|
|
|
|
st, err := util.NewBeaconState()
|
|
require.NoError(t, err)
|
|
// a state is required to save checkpoint
|
|
require.NoError(t, db.SaveState(ctx, st, root))
|
|
require.NoError(t, db.SaveFinalizedCheckpoint(ctx, cp))
|
|
|
|
// All blocks up to slotsPerEpoch should have a finalized child block.
|
|
for i := uint64(0); i < slotsPerEpoch; i++ {
|
|
root, err := blks[i].Block().HashTreeRoot()
|
|
require.NoError(t, err)
|
|
assert.Equal(t, true, db.IsFinalizedBlock(ctx, root), "Block at index %d was not considered finalized in the index", i)
|
|
blk, err := db.FinalizedChildBlock(ctx, root)
|
|
assert.NoError(t, err)
|
|
if blk == nil {
|
|
t.Error("Child block doesn't exist for valid finalized block.")
|
|
}
|
|
}
|
|
}
|
|
|
|
func TestStore_IsFinalizedChildBlockAltair(t *testing.T) {
|
|
slotsPerEpoch := uint64(params.BeaconConfig().SlotsPerEpoch)
|
|
db := setupDB(t)
|
|
ctx := context.Background()
|
|
|
|
require.NoError(t, db.SaveGenesisBlockRoot(ctx, genesisBlockRoot))
|
|
|
|
blks := makeBlocksAltair(t, 0, slotsPerEpoch*3, genesisBlockRoot)
|
|
|
|
require.NoError(t, db.SaveBlocks(ctx, blks))
|
|
root, err := blks[slotsPerEpoch].Block().HashTreeRoot()
|
|
require.NoError(t, err)
|
|
|
|
cp := ðpb.Checkpoint{
|
|
Epoch: 1,
|
|
Root: root[:],
|
|
}
|
|
|
|
st, err := util.NewBeaconState()
|
|
require.NoError(t, err)
|
|
// a state is required to save checkpoint
|
|
require.NoError(t, db.SaveState(ctx, st, root))
|
|
require.NoError(t, db.SaveFinalizedCheckpoint(ctx, cp))
|
|
|
|
// All blocks up to slotsPerEpoch should have a finalized child block.
|
|
for i := uint64(0); i < slotsPerEpoch; i++ {
|
|
root, err := blks[i].Block().HashTreeRoot()
|
|
require.NoError(t, err)
|
|
assert.Equal(t, true, db.IsFinalizedBlock(ctx, root), "Block at index %d was not considered finalized in the index", i)
|
|
blk, err := db.FinalizedChildBlock(ctx, root)
|
|
assert.NoError(t, err)
|
|
if blk == nil {
|
|
t.Error("Child block doesn't exist for valid finalized block.")
|
|
}
|
|
}
|
|
}
|
|
|
|
func sszRootOrDie(t *testing.T, block block.SignedBeaconBlock) []byte {
|
|
root, err := block.Block().HashTreeRoot()
|
|
require.NoError(t, err)
|
|
return root[:]
|
|
}
|
|
|
|
func makeBlocks(t *testing.T, i, n uint64, previousRoot [32]byte) []block.SignedBeaconBlock {
|
|
blocks := make([]*ethpb.SignedBeaconBlock, n)
|
|
ifaceBlocks := make([]block.SignedBeaconBlock, n)
|
|
for j := i; j < n+i; j++ {
|
|
parentRoot := make([]byte, fieldparams.RootLength)
|
|
copy(parentRoot, previousRoot[:])
|
|
blocks[j-i] = util.NewBeaconBlock()
|
|
blocks[j-i].Block.Slot = types.Slot(j + 1)
|
|
blocks[j-i].Block.ParentRoot = parentRoot
|
|
var err error
|
|
previousRoot, err = blocks[j-i].Block.HashTreeRoot()
|
|
require.NoError(t, err)
|
|
ifaceBlocks[j-i] = wrapper.WrappedPhase0SignedBeaconBlock(blocks[j-i])
|
|
}
|
|
return ifaceBlocks
|
|
}
|
|
|
|
func makeBlocksAltair(t *testing.T, startIdx, num uint64, previousRoot [32]byte) []block.SignedBeaconBlock {
|
|
blocks := make([]*ethpb.SignedBeaconBlockAltair, num)
|
|
ifaceBlocks := make([]block.SignedBeaconBlock, num)
|
|
for j := startIdx; j < num+startIdx; j++ {
|
|
parentRoot := make([]byte, fieldparams.RootLength)
|
|
copy(parentRoot, previousRoot[:])
|
|
blocks[j-startIdx] = util.NewBeaconBlockAltair()
|
|
blocks[j-startIdx].Block.Slot = types.Slot(j + 1)
|
|
blocks[j-startIdx].Block.ParentRoot = parentRoot
|
|
var err error
|
|
previousRoot, err = blocks[j-startIdx].Block.HashTreeRoot()
|
|
require.NoError(t, err)
|
|
ifaceBlocks[j-startIdx], err = wrapper.WrappedAltairSignedBeaconBlock(blocks[j-startIdx])
|
|
require.NoError(t, err)
|
|
}
|
|
return ifaceBlocks
|
|
}
|