mirror of
https://gitlab.com/pulsechaincom/prysm-pulse.git
synced 2024-12-26 13:18:57 +00:00
2536195be0
* Change forkchoice API doubly-linked-tree changes * protoarray changes * blockchain tests * rebase and fix conflicts * More blockchain fixes * blockchain test fixes * doubly linked tree changes again * protoarray changes v2 * blockchain packages v2 * Radek's review * Fix on batch processing * Terence's review * fill in at start * Revert "fill in at start" This reverts commit 8c11db063a02a59df8e0ac6d0af0c8923921dc76. * wrap error message * fill in before mutating the state * wrap nil node errors * handle unknown optimistic status on init sync * rename insert function * prune on batches only after forkchoice insertion Co-authored-by: terencechain <terence@prysmaticlabs.com>
246 lines
11 KiB
Go
246 lines
11 KiB
Go
package doublylinkedtree
|
|
|
|
import (
|
|
"context"
|
|
"testing"
|
|
|
|
"github.com/prysmaticlabs/prysm/config/params"
|
|
types "github.com/prysmaticlabs/prysm/consensus-types/primitives"
|
|
ethpb "github.com/prysmaticlabs/prysm/proto/prysm/v1alpha1"
|
|
"github.com/prysmaticlabs/prysm/testing/require"
|
|
)
|
|
|
|
func TestStore_SetUnrealizedEpochs(t *testing.T) {
|
|
f := setup(1, 1)
|
|
ctx := context.Background()
|
|
state, blkRoot, err := prepareForkchoiceState(ctx, 100, [32]byte{'a'}, params.BeaconConfig().ZeroHash, [32]byte{'A'}, 1, 1)
|
|
require.NoError(t, err)
|
|
require.NoError(t, f.InsertNode(ctx, state, blkRoot))
|
|
state, blkRoot, err = prepareForkchoiceState(ctx, 101, [32]byte{'b'}, [32]byte{'a'}, [32]byte{'B'}, 1, 1)
|
|
require.NoError(t, err)
|
|
require.NoError(t, f.InsertNode(ctx, state, blkRoot))
|
|
state, blkRoot, err = prepareForkchoiceState(ctx, 102, [32]byte{'c'}, [32]byte{'b'}, [32]byte{'C'}, 1, 1)
|
|
require.NoError(t, err)
|
|
require.NoError(t, f.InsertNode(ctx, state, blkRoot))
|
|
f.store.nodesLock.RLock()
|
|
require.Equal(t, types.Epoch(1), f.store.nodeByRoot[[32]byte{'b'}].unrealizedJustifiedEpoch)
|
|
require.Equal(t, types.Epoch(1), f.store.nodeByRoot[[32]byte{'b'}].unrealizedFinalizedEpoch)
|
|
f.store.nodesLock.RUnlock()
|
|
require.NoError(t, f.store.setUnrealizedJustifiedEpoch([32]byte{'b'}, 2))
|
|
require.NoError(t, f.store.setUnrealizedFinalizedEpoch([32]byte{'b'}, 2))
|
|
f.store.nodesLock.RLock()
|
|
require.Equal(t, types.Epoch(2), f.store.nodeByRoot[[32]byte{'b'}].unrealizedJustifiedEpoch)
|
|
require.Equal(t, types.Epoch(2), f.store.nodeByRoot[[32]byte{'b'}].unrealizedFinalizedEpoch)
|
|
f.store.nodesLock.RUnlock()
|
|
|
|
require.ErrorIs(t, errInvalidUnrealizedJustifiedEpoch, f.store.setUnrealizedJustifiedEpoch([32]byte{'b'}, 0))
|
|
require.ErrorIs(t, errInvalidUnrealizedFinalizedEpoch, f.store.setUnrealizedFinalizedEpoch([32]byte{'b'}, 0))
|
|
}
|
|
|
|
func TestStore_UpdateUnrealizedCheckpoints(t *testing.T) {
|
|
f := setup(1, 1)
|
|
ctx := context.Background()
|
|
state, blkRoot, err := prepareForkchoiceState(ctx, 100, [32]byte{'a'}, params.BeaconConfig().ZeroHash, [32]byte{'A'}, 1, 1)
|
|
require.NoError(t, err)
|
|
require.NoError(t, f.InsertNode(ctx, state, blkRoot))
|
|
state, blkRoot, err = prepareForkchoiceState(ctx, 101, [32]byte{'b'}, [32]byte{'a'}, [32]byte{'B'}, 1, 1)
|
|
require.NoError(t, err)
|
|
require.NoError(t, f.InsertNode(ctx, state, blkRoot))
|
|
state, blkRoot, err = prepareForkchoiceState(ctx, 102, [32]byte{'c'}, [32]byte{'b'}, [32]byte{'C'}, 1, 1)
|
|
require.NoError(t, err)
|
|
require.NoError(t, f.InsertNode(ctx, state, blkRoot))
|
|
|
|
}
|
|
|
|
//
|
|
// Epoch 2 | Epoch 3
|
|
// |
|
|
// C |
|
|
// / |
|
|
// A <-- B |
|
|
// \ |
|
|
// ---- D
|
|
//
|
|
// B is the first block that justifies A.
|
|
//
|
|
func TestStore_LongFork(t *testing.T) {
|
|
f := setup(1, 1)
|
|
ctx := context.Background()
|
|
state, blkRoot, err := prepareForkchoiceState(ctx, 100, [32]byte{'a'}, params.BeaconConfig().ZeroHash, [32]byte{'A'}, 1, 1)
|
|
require.NoError(t, err)
|
|
require.NoError(t, f.InsertNode(ctx, state, blkRoot))
|
|
state, blkRoot, err = prepareForkchoiceState(ctx, 101, [32]byte{'b'}, [32]byte{'a'}, [32]byte{'B'}, 1, 1)
|
|
require.NoError(t, err)
|
|
require.NoError(t, f.InsertNode(ctx, state, blkRoot))
|
|
require.NoError(t, f.store.setUnrealizedJustifiedEpoch([32]byte{'b'}, 2))
|
|
state, blkRoot, err = prepareForkchoiceState(ctx, 102, [32]byte{'c'}, [32]byte{'b'}, [32]byte{'C'}, 1, 1)
|
|
require.NoError(t, err)
|
|
require.NoError(t, f.InsertNode(ctx, state, blkRoot))
|
|
require.NoError(t, f.store.setUnrealizedJustifiedEpoch([32]byte{'c'}, 2))
|
|
|
|
// Add an attestation to c, it is head
|
|
f.ProcessAttestation(ctx, []uint64{0}, [32]byte{'c'}, 1)
|
|
headRoot, err := f.Head(ctx, [32]byte{}, []uint64{100})
|
|
require.NoError(t, err)
|
|
require.Equal(t, [32]byte{'c'}, headRoot)
|
|
|
|
// D is head even though its weight is lower.
|
|
hr := [32]byte{'d'}
|
|
state, blkRoot, err = prepareForkchoiceState(ctx, 103, hr, [32]byte{'b'}, [32]byte{'D'}, 2, 1)
|
|
require.NoError(t, err)
|
|
require.NoError(t, f.InsertNode(ctx, state, blkRoot))
|
|
require.NoError(t, f.UpdateJustifiedCheckpoint(ðpb.Checkpoint{Epoch: 2, Root: hr[:]}))
|
|
headRoot, err = f.Head(ctx, [32]byte{}, []uint64{100})
|
|
require.NoError(t, err)
|
|
require.Equal(t, [32]byte{'d'}, headRoot)
|
|
require.Equal(t, uint64(0), f.store.nodeByRoot[[32]byte{'d'}].weight)
|
|
require.Equal(t, uint64(100), f.store.nodeByRoot[[32]byte{'c'}].weight)
|
|
|
|
// Update unrealized justification, c becomes head
|
|
f.UpdateUnrealizedCheckpoints()
|
|
headRoot, err = f.Head(ctx, [32]byte{}, []uint64{100})
|
|
require.NoError(t, err)
|
|
require.Equal(t, [32]byte{'c'}, headRoot)
|
|
}
|
|
|
|
//
|
|
//
|
|
// Epoch 1 Epoch 2 Epoch 3
|
|
// | |
|
|
// | |
|
|
// A <-- B <-- C <-- D <-- E <-- F <-- G <-- H |
|
|
// | \ |
|
|
// | --------------- I
|
|
// | |
|
|
//
|
|
// E justifies A. G justifies E.
|
|
//
|
|
func TestStore_NoDeadLock(t *testing.T) {
|
|
f := setup(0, 0)
|
|
ctx := context.Background()
|
|
|
|
// Epoch 1 blocks
|
|
state, blkRoot, err := prepareForkchoiceState(ctx, 100, [32]byte{'a'}, params.BeaconConfig().ZeroHash, [32]byte{'A'}, 0, 0)
|
|
require.NoError(t, err)
|
|
require.NoError(t, f.InsertNode(ctx, state, blkRoot))
|
|
state, blkRoot, err = prepareForkchoiceState(ctx, 101, [32]byte{'b'}, [32]byte{'a'}, [32]byte{'B'}, 0, 0)
|
|
require.NoError(t, err)
|
|
require.NoError(t, f.InsertNode(ctx, state, blkRoot))
|
|
state, blkRoot, err = prepareForkchoiceState(ctx, 102, [32]byte{'c'}, [32]byte{'b'}, [32]byte{'C'}, 0, 0)
|
|
require.NoError(t, err)
|
|
require.NoError(t, f.InsertNode(ctx, state, blkRoot))
|
|
state, blkRoot, err = prepareForkchoiceState(ctx, 103, [32]byte{'d'}, [32]byte{'c'}, [32]byte{'D'}, 0, 0)
|
|
require.NoError(t, err)
|
|
require.NoError(t, f.InsertNode(ctx, state, blkRoot))
|
|
|
|
// Epoch 2 Blocks
|
|
state, blkRoot, err = prepareForkchoiceState(ctx, 104, [32]byte{'e'}, [32]byte{'d'}, [32]byte{'E'}, 0, 0)
|
|
require.NoError(t, err)
|
|
require.NoError(t, f.InsertNode(ctx, state, blkRoot))
|
|
require.NoError(t, f.store.setUnrealizedJustifiedEpoch([32]byte{'e'}, 1))
|
|
state, blkRoot, err = prepareForkchoiceState(ctx, 105, [32]byte{'f'}, [32]byte{'e'}, [32]byte{'F'}, 0, 0)
|
|
require.NoError(t, err)
|
|
require.NoError(t, f.InsertNode(ctx, state, blkRoot))
|
|
require.NoError(t, f.store.setUnrealizedJustifiedEpoch([32]byte{'f'}, 1))
|
|
state, blkRoot, err = prepareForkchoiceState(ctx, 106, [32]byte{'g'}, [32]byte{'f'}, [32]byte{'G'}, 0, 0)
|
|
require.NoError(t, err)
|
|
require.NoError(t, f.InsertNode(ctx, state, blkRoot))
|
|
require.NoError(t, f.store.setUnrealizedJustifiedEpoch([32]byte{'g'}, 2))
|
|
require.NoError(t, f.store.setUnrealizedFinalizedEpoch([32]byte{'g'}, 1))
|
|
state, blkRoot, err = prepareForkchoiceState(ctx, 107, [32]byte{'h'}, [32]byte{'g'}, [32]byte{'H'}, 0, 0)
|
|
require.NoError(t, err)
|
|
require.NoError(t, f.InsertNode(ctx, state, blkRoot))
|
|
require.NoError(t, f.store.setUnrealizedJustifiedEpoch([32]byte{'h'}, 2))
|
|
require.NoError(t, f.store.setUnrealizedFinalizedEpoch([32]byte{'h'}, 1))
|
|
// Add an attestation for h
|
|
f.ProcessAttestation(ctx, []uint64{0}, [32]byte{'h'}, 1)
|
|
|
|
// Epoch 3
|
|
// Current Head is H
|
|
headRoot, err := f.Head(ctx, [32]byte{}, []uint64{100})
|
|
require.NoError(t, err)
|
|
require.Equal(t, [32]byte{'h'}, headRoot)
|
|
require.Equal(t, types.Epoch(0), f.JustifiedEpoch())
|
|
|
|
// Insert Block I, it becomes Head
|
|
hr := [32]byte{'i'}
|
|
state, blkRoot, err = prepareForkchoiceState(ctx, 108, hr, [32]byte{'f'}, [32]byte{'I'}, 1, 0)
|
|
require.NoError(t, err)
|
|
require.NoError(t, f.InsertNode(ctx, state, blkRoot))
|
|
require.NoError(t, f.UpdateJustifiedCheckpoint(ðpb.Checkpoint{Epoch: 1, Root: hr[:]}))
|
|
headRoot, err = f.Head(ctx, [32]byte{}, []uint64{100})
|
|
require.NoError(t, err)
|
|
require.Equal(t, [32]byte{'i'}, headRoot)
|
|
require.Equal(t, types.Epoch(1), f.JustifiedEpoch())
|
|
require.Equal(t, types.Epoch(0), f.FinalizedEpoch())
|
|
|
|
// Realized Justified checkpoints, H becomes head
|
|
f.UpdateUnrealizedCheckpoints()
|
|
headRoot, err = f.Head(ctx, [32]byte{}, []uint64{100})
|
|
require.NoError(t, err)
|
|
require.Equal(t, [32]byte{'h'}, headRoot)
|
|
require.Equal(t, types.Epoch(2), f.JustifiedEpoch())
|
|
require.Equal(t, types.Epoch(1), f.FinalizedEpoch())
|
|
}
|
|
|
|
// Epoch 1 | Epoch 2
|
|
// |
|
|
// -- D (late)
|
|
// / |
|
|
// A <- B <- C |
|
|
// \ |
|
|
// -- -- -- E <- F <- G <- H
|
|
// |
|
|
//
|
|
// D justifies and comes late.
|
|
//
|
|
func TestStore_ForkNextEpoch(t *testing.T) {
|
|
f := setup(0, 0)
|
|
ctx := context.Background()
|
|
|
|
// Epoch 1 blocks (D does not arrive)
|
|
state, blkRoot, err := prepareForkchoiceState(ctx, 100, [32]byte{'a'}, params.BeaconConfig().ZeroHash, [32]byte{'A'}, 0, 0)
|
|
require.NoError(t, err)
|
|
require.NoError(t, f.InsertNode(ctx, state, blkRoot))
|
|
state, blkRoot, err = prepareForkchoiceState(ctx, 101, [32]byte{'b'}, [32]byte{'a'}, [32]byte{'B'}, 0, 0)
|
|
require.NoError(t, err)
|
|
require.NoError(t, f.InsertNode(ctx, state, blkRoot))
|
|
state, blkRoot, err = prepareForkchoiceState(ctx, 102, [32]byte{'c'}, [32]byte{'b'}, [32]byte{'C'}, 0, 0)
|
|
require.NoError(t, err)
|
|
require.NoError(t, f.InsertNode(ctx, state, blkRoot))
|
|
|
|
// Epoch 2 blocks
|
|
state, blkRoot, err = prepareForkchoiceState(ctx, 104, [32]byte{'e'}, [32]byte{'c'}, [32]byte{'E'}, 0, 0)
|
|
require.NoError(t, err)
|
|
require.NoError(t, f.InsertNode(ctx, state, blkRoot))
|
|
state, blkRoot, err = prepareForkchoiceState(ctx, 105, [32]byte{'f'}, [32]byte{'e'}, [32]byte{'F'}, 0, 0)
|
|
require.NoError(t, err)
|
|
require.NoError(t, f.InsertNode(ctx, state, blkRoot))
|
|
state, blkRoot, err = prepareForkchoiceState(ctx, 106, [32]byte{'g'}, [32]byte{'f'}, [32]byte{'G'}, 0, 0)
|
|
require.NoError(t, err)
|
|
require.NoError(t, f.InsertNode(ctx, state, blkRoot))
|
|
state, blkRoot, err = prepareForkchoiceState(ctx, 107, [32]byte{'h'}, [32]byte{'g'}, [32]byte{'H'}, 0, 0)
|
|
require.NoError(t, err)
|
|
require.NoError(t, f.InsertNode(ctx, state, blkRoot))
|
|
|
|
// Insert an attestation to H, H is head
|
|
f.ProcessAttestation(ctx, []uint64{0}, [32]byte{'h'}, 1)
|
|
headRoot, err := f.Head(ctx, [32]byte{}, []uint64{100})
|
|
require.NoError(t, err)
|
|
require.Equal(t, [32]byte{'h'}, headRoot)
|
|
require.Equal(t, types.Epoch(0), f.JustifiedEpoch())
|
|
|
|
// D arrives late, D is head
|
|
state, blkRoot, err = prepareForkchoiceState(ctx, 103, [32]byte{'d'}, [32]byte{'c'}, [32]byte{'D'}, 0, 0)
|
|
require.NoError(t, err)
|
|
require.NoError(t, f.InsertNode(ctx, state, blkRoot))
|
|
require.NoError(t, f.store.setUnrealizedJustifiedEpoch([32]byte{'d'}, 1))
|
|
f.UpdateUnrealizedCheckpoints()
|
|
headRoot, err = f.Head(ctx, [32]byte{}, []uint64{100})
|
|
require.NoError(t, err)
|
|
require.Equal(t, [32]byte{'d'}, headRoot)
|
|
require.Equal(t, types.Epoch(1), f.JustifiedEpoch())
|
|
require.Equal(t, uint64(0), f.store.nodeByRoot[[32]byte{'d'}].weight)
|
|
require.Equal(t, uint64(100), f.store.nodeByRoot[[32]byte{'h'}].weight)
|
|
}
|