2019-10-29 15:14:17 +00:00
|
|
|
package kv
|
|
|
|
|
|
|
|
import (
|
|
|
|
"context"
|
|
|
|
"testing"
|
|
|
|
|
|
|
|
"github.com/prysmaticlabs/go-ssz"
|
|
|
|
pb "github.com/prysmaticlabs/prysm/proto/beacon/p2p/v1"
|
|
|
|
ethpb "github.com/prysmaticlabs/prysm/proto/eth/v1alpha1"
|
|
|
|
"github.com/prysmaticlabs/prysm/shared/bytesutil"
|
2019-11-08 03:00:47 +00:00
|
|
|
"github.com/prysmaticlabs/prysm/shared/params"
|
2019-10-29 15:14:17 +00:00
|
|
|
)
|
|
|
|
|
|
|
|
var genesisBlockRoot = bytesutil.ToBytes32([]byte{'G', 'E', 'N', 'E', 'S', 'I', 'S'})
|
|
|
|
|
|
|
|
func TestStore_IsFinalizedBlock(t *testing.T) {
|
2019-11-08 03:00:47 +00:00
|
|
|
slotsPerEpoch := int(params.BeaconConfig().SlotsPerEpoch)
|
2019-10-29 15:14:17 +00:00
|
|
|
db := setupDB(t)
|
|
|
|
defer teardownDB(t, db)
|
|
|
|
ctx := context.Background()
|
|
|
|
|
|
|
|
if err := db.SaveGenesisBlockRoot(ctx, genesisBlockRoot); err != nil {
|
|
|
|
t.Fatal(err)
|
|
|
|
}
|
|
|
|
|
2019-11-08 03:00:47 +00:00
|
|
|
blks := makeBlocks(t, 0, slotsPerEpoch*3, genesisBlockRoot)
|
2019-10-29 15:14:17 +00:00
|
|
|
if err := db.SaveBlocks(ctx, blks); err != nil {
|
|
|
|
t.Fatal(err)
|
|
|
|
}
|
|
|
|
|
2019-11-08 03:00:47 +00:00
|
|
|
root, err := ssz.SigningRoot(blks[slotsPerEpoch])
|
2019-10-29 15:14:17 +00:00
|
|
|
if err != nil {
|
|
|
|
t.Fatal(err)
|
|
|
|
}
|
|
|
|
|
|
|
|
cp := ðpb.Checkpoint{
|
|
|
|
Epoch: 1,
|
|
|
|
Root: root[:],
|
|
|
|
}
|
|
|
|
|
|
|
|
// a state is required to save checkpoint
|
|
|
|
if err := db.SaveState(ctx, &pb.BeaconState{}, root); err != nil {
|
|
|
|
t.Fatal(err)
|
|
|
|
}
|
|
|
|
|
|
|
|
if err := db.SaveFinalizedCheckpoint(ctx, cp); err != nil {
|
|
|
|
t.Fatal(err)
|
|
|
|
}
|
|
|
|
|
2019-11-08 03:00:47 +00:00
|
|
|
// All blocks up to slotsPerEpoch*2 should be in the finalized index.
|
|
|
|
for i := 0; i < slotsPerEpoch*2; i++ {
|
2019-10-29 15:14:17 +00:00
|
|
|
root, err := ssz.SigningRoot(blks[i])
|
|
|
|
if err != nil {
|
|
|
|
t.Fatal(err)
|
|
|
|
}
|
|
|
|
if !db.IsFinalizedBlock(ctx, root) {
|
|
|
|
t.Errorf("Block at index %d was not considered finalized in the index", i)
|
|
|
|
}
|
|
|
|
}
|
2019-11-08 03:00:47 +00:00
|
|
|
for i := slotsPerEpoch*3; i < len(blks); i++ {
|
2019-10-29 15:14:17 +00:00
|
|
|
root, err := ssz.SigningRoot(blks[i])
|
|
|
|
if err != nil {
|
|
|
|
t.Fatal(err)
|
|
|
|
}
|
|
|
|
if db.IsFinalizedBlock(ctx, root) {
|
|
|
|
t.Errorf("Block at index %d was considered finalized in the index, but should not have", i)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-11-08 03:00:47 +00:00
|
|
|
// 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 := int(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)
|
|
|
|
defer teardownDB(t, db)
|
|
|
|
ctx := context.Background()
|
|
|
|
|
|
|
|
if err := db.SaveGenesisBlockRoot(ctx, genesisBlockRoot); err != nil {
|
|
|
|
t.Fatal(err)
|
|
|
|
}
|
|
|
|
if err := db.SaveBlocks(ctx, blocks0); err != nil {
|
|
|
|
t.Fatal(err)
|
|
|
|
}
|
|
|
|
if err := db.SaveBlocks(ctx, blocks1); err != nil {
|
|
|
|
t.Fatal(err)
|
|
|
|
}
|
|
|
|
if err := db.SaveBlocks(ctx, blocks2); err != nil {
|
|
|
|
t.Fatal(err)
|
|
|
|
}
|
|
|
|
|
|
|
|
// First checkpoint
|
|
|
|
checkpoint1 := ðpb.Checkpoint{
|
|
|
|
Root: sszRootOrDie(t, blocks1[0]),
|
|
|
|
Epoch: 1,
|
|
|
|
}
|
|
|
|
// A state is required to save checkpoint
|
|
|
|
if err := db.SaveState(ctx, &pb.BeaconState{}, bytesutil.ToBytes32(checkpoint1.Root)); err != nil {
|
|
|
|
t.Fatal(err)
|
|
|
|
}
|
|
|
|
if err := db.SaveFinalizedCheckpoint(ctx, checkpoint1); err != nil {
|
|
|
|
t.Fatal(err)
|
|
|
|
}
|
|
|
|
// All blocks in blocks0 and blocks1 should be finalized and canonical.
|
|
|
|
for i, block := range append(blocks0, blocks1...) {
|
|
|
|
root := sszRootOrDie(t, block)
|
|
|
|
if !db.IsFinalizedBlock(ctx, bytesutil.ToBytes32(root)) {
|
|
|
|
t.Errorf("%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
|
|
|
|
if err := db.SaveState(ctx, &pb.BeaconState{}, bytesutil.ToBytes32(checkpoint2.Root)); err != nil {
|
|
|
|
t.Fatal(err)
|
|
|
|
}
|
|
|
|
if err := db.SaveFinalizedCheckpoint(ctx, checkpoint2); err != nil {
|
|
|
|
t.Error(err)
|
|
|
|
}
|
|
|
|
// All blocks in blocks0 and blocks2 should be finalized and canonical.
|
|
|
|
for i, block := range append(blocks0, blocks2...) {
|
|
|
|
root := sszRootOrDie(t, block)
|
|
|
|
if !db.IsFinalizedBlock(ctx, bytesutil.ToBytes32(root)) {
|
|
|
|
t.Errorf("%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 sszRootOrDie(t *testing.T, block *ethpb.BeaconBlock) []byte {
|
|
|
|
root, err := ssz.SigningRoot(block)
|
|
|
|
if err != nil {
|
|
|
|
t.Fatal(err)
|
|
|
|
}
|
|
|
|
return root[:]
|
|
|
|
}
|
|
|
|
|
|
|
|
func makeBlocks(t *testing.T, i, n int, previousRoot [32]byte) []*ethpb.BeaconBlock {
|
2019-10-29 15:14:17 +00:00
|
|
|
blocks := make([]*ethpb.BeaconBlock, n)
|
2019-11-08 03:00:47 +00:00
|
|
|
for j := i; j < n+i; j++ {
|
2019-10-29 15:14:17 +00:00
|
|
|
parentRoot := make([]byte, 32)
|
|
|
|
copy(parentRoot, previousRoot[:])
|
2019-11-08 03:00:47 +00:00
|
|
|
blocks[j-i] = ðpb.BeaconBlock{
|
|
|
|
Slot: uint64(j + 1),
|
2019-10-29 15:14:17 +00:00
|
|
|
ParentRoot: parentRoot,
|
|
|
|
}
|
|
|
|
var err error
|
2019-11-08 03:00:47 +00:00
|
|
|
previousRoot, err = ssz.SigningRoot(blocks[j-i])
|
2019-10-29 15:14:17 +00:00
|
|
|
if err != nil {
|
|
|
|
t.Fatal(err)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return blocks
|
|
|
|
}
|