mirror of
https://gitlab.com/pulsechaincom/prysm-pulse.git
synced 2024-12-25 21:07:18 +00:00
306 lines
13 KiB
Go
306 lines
13 KiB
Go
package doublylinkedtree
|
|
|
|
import (
|
|
"context"
|
|
"testing"
|
|
|
|
"github.com/prysmaticlabs/prysm/v3/config/params"
|
|
types "github.com/prysmaticlabs/prysm/v3/consensus-types/primitives"
|
|
v1 "github.com/prysmaticlabs/prysm/v3/proto/eth/v1"
|
|
"github.com/prysmaticlabs/prysm/v3/testing/assert"
|
|
"github.com/prysmaticlabs/prysm/v3/testing/require"
|
|
)
|
|
|
|
func TestNode_ApplyWeightChanges_PositiveChange(t *testing.T) {
|
|
f := setup(0, 0)
|
|
ctx := context.Background()
|
|
state, blkRoot, err := prepareForkchoiceState(ctx, 1, indexToHash(1), params.BeaconConfig().ZeroHash, params.BeaconConfig().ZeroHash, 0, 0)
|
|
require.NoError(t, err)
|
|
require.NoError(t, f.InsertNode(ctx, state, blkRoot))
|
|
state, blkRoot, err = prepareForkchoiceState(ctx, 2, indexToHash(2), indexToHash(1), params.BeaconConfig().ZeroHash, 0, 0)
|
|
require.NoError(t, err)
|
|
require.NoError(t, f.InsertNode(ctx, state, blkRoot))
|
|
state, blkRoot, err = prepareForkchoiceState(ctx, 3, indexToHash(3), indexToHash(2), params.BeaconConfig().ZeroHash, 0, 0)
|
|
require.NoError(t, err)
|
|
require.NoError(t, f.InsertNode(ctx, state, blkRoot))
|
|
|
|
// The updated balances of each node is 100
|
|
s := f.store
|
|
|
|
s.nodesLock.Lock()
|
|
defer s.nodesLock.Unlock()
|
|
s.nodeByRoot[indexToHash(1)].balance = 100
|
|
s.nodeByRoot[indexToHash(2)].balance = 100
|
|
s.nodeByRoot[indexToHash(3)].balance = 100
|
|
|
|
assert.NoError(t, s.treeRootNode.applyWeightChanges(ctx))
|
|
|
|
assert.Equal(t, uint64(300), s.nodeByRoot[indexToHash(1)].weight)
|
|
assert.Equal(t, uint64(200), s.nodeByRoot[indexToHash(2)].weight)
|
|
assert.Equal(t, uint64(100), s.nodeByRoot[indexToHash(3)].weight)
|
|
}
|
|
|
|
func TestNode_ApplyWeightChanges_NegativeChange(t *testing.T) {
|
|
f := setup(0, 0)
|
|
ctx := context.Background()
|
|
state, blkRoot, err := prepareForkchoiceState(ctx, 1, indexToHash(1), params.BeaconConfig().ZeroHash, params.BeaconConfig().ZeroHash, 0, 0)
|
|
require.NoError(t, err)
|
|
require.NoError(t, f.InsertNode(ctx, state, blkRoot))
|
|
state, blkRoot, err = prepareForkchoiceState(ctx, 2, indexToHash(2), indexToHash(1), params.BeaconConfig().ZeroHash, 0, 0)
|
|
require.NoError(t, err)
|
|
require.NoError(t, f.InsertNode(ctx, state, blkRoot))
|
|
state, blkRoot, err = prepareForkchoiceState(ctx, 3, indexToHash(3), indexToHash(2), params.BeaconConfig().ZeroHash, 0, 0)
|
|
require.NoError(t, err)
|
|
require.NoError(t, f.InsertNode(ctx, state, blkRoot))
|
|
|
|
// The updated balances of each node is 100
|
|
s := f.store
|
|
s.nodesLock.Lock()
|
|
defer s.nodesLock.Unlock()
|
|
s.nodeByRoot[indexToHash(1)].weight = 400
|
|
s.nodeByRoot[indexToHash(2)].weight = 400
|
|
s.nodeByRoot[indexToHash(3)].weight = 400
|
|
|
|
s.nodeByRoot[indexToHash(1)].balance = 100
|
|
s.nodeByRoot[indexToHash(2)].balance = 100
|
|
s.nodeByRoot[indexToHash(3)].balance = 100
|
|
|
|
assert.NoError(t, s.treeRootNode.applyWeightChanges(ctx))
|
|
|
|
assert.Equal(t, uint64(300), s.nodeByRoot[indexToHash(1)].weight)
|
|
assert.Equal(t, uint64(200), s.nodeByRoot[indexToHash(2)].weight)
|
|
assert.Equal(t, uint64(100), s.nodeByRoot[indexToHash(3)].weight)
|
|
}
|
|
|
|
func TestNode_UpdateBestDescendant_NonViableChild(t *testing.T) {
|
|
f := setup(1, 1)
|
|
ctx := context.Background()
|
|
// Input child is not viable.
|
|
state, blkRoot, err := prepareForkchoiceState(ctx, 1, indexToHash(1), params.BeaconConfig().ZeroHash, params.BeaconConfig().ZeroHash, 2, 3)
|
|
require.NoError(t, err)
|
|
require.NoError(t, f.InsertNode(ctx, state, blkRoot))
|
|
|
|
// Verify parent's best child and best descendant are `none`.
|
|
s := f.store
|
|
assert.Equal(t, 1, len(s.treeRootNode.children))
|
|
nilBestDescendant := s.treeRootNode.bestDescendant == nil
|
|
assert.Equal(t, true, nilBestDescendant)
|
|
}
|
|
|
|
func TestNode_UpdateBestDescendant_ViableChild(t *testing.T) {
|
|
f := setup(1, 1)
|
|
ctx := context.Background()
|
|
// Input child is best descendant
|
|
state, blkRoot, err := prepareForkchoiceState(ctx, 1, indexToHash(1), params.BeaconConfig().ZeroHash, params.BeaconConfig().ZeroHash, 1, 1)
|
|
require.NoError(t, err)
|
|
require.NoError(t, f.InsertNode(ctx, state, blkRoot))
|
|
|
|
s := f.store
|
|
assert.Equal(t, 1, len(s.treeRootNode.children))
|
|
assert.Equal(t, s.treeRootNode.children[0], s.treeRootNode.bestDescendant)
|
|
}
|
|
|
|
func TestNode_UpdateBestDescendant_HigherWeightChild(t *testing.T) {
|
|
f := setup(1, 1)
|
|
ctx := context.Background()
|
|
// Input child is best descendant
|
|
state, blkRoot, err := prepareForkchoiceState(ctx, 1, indexToHash(1), params.BeaconConfig().ZeroHash, params.BeaconConfig().ZeroHash, 1, 1)
|
|
require.NoError(t, err)
|
|
require.NoError(t, f.InsertNode(ctx, state, blkRoot))
|
|
state, blkRoot, err = prepareForkchoiceState(ctx, 2, indexToHash(2), params.BeaconConfig().ZeroHash, params.BeaconConfig().ZeroHash, 1, 1)
|
|
require.NoError(t, err)
|
|
require.NoError(t, f.InsertNode(ctx, state, blkRoot))
|
|
|
|
s := f.store
|
|
s.nodeByRoot[indexToHash(1)].weight = 100
|
|
s.nodeByRoot[indexToHash(2)].weight = 200
|
|
assert.NoError(t, s.treeRootNode.updateBestDescendant(ctx, 1, 1, 1))
|
|
|
|
assert.Equal(t, 2, len(s.treeRootNode.children))
|
|
assert.Equal(t, s.treeRootNode.children[1], s.treeRootNode.bestDescendant)
|
|
}
|
|
|
|
func TestNode_UpdateBestDescendant_LowerWeightChild(t *testing.T) {
|
|
f := setup(1, 1)
|
|
ctx := context.Background()
|
|
// Input child is best descendant
|
|
state, blkRoot, err := prepareForkchoiceState(ctx, 1, indexToHash(1), params.BeaconConfig().ZeroHash, params.BeaconConfig().ZeroHash, 1, 1)
|
|
require.NoError(t, err)
|
|
require.NoError(t, f.InsertNode(ctx, state, blkRoot))
|
|
state, blkRoot, err = prepareForkchoiceState(ctx, 2, indexToHash(2), params.BeaconConfig().ZeroHash, params.BeaconConfig().ZeroHash, 1, 1)
|
|
require.NoError(t, err)
|
|
require.NoError(t, f.InsertNode(ctx, state, blkRoot))
|
|
|
|
s := f.store
|
|
s.nodeByRoot[indexToHash(1)].weight = 200
|
|
s.nodeByRoot[indexToHash(2)].weight = 100
|
|
assert.NoError(t, s.treeRootNode.updateBestDescendant(ctx, 1, 1, 1))
|
|
|
|
assert.Equal(t, 2, len(s.treeRootNode.children))
|
|
assert.Equal(t, s.treeRootNode.children[0], s.treeRootNode.bestDescendant)
|
|
}
|
|
|
|
func TestNode_ViableForHead(t *testing.T) {
|
|
tests := []struct {
|
|
n *Node
|
|
justifiedEpoch types.Epoch
|
|
finalizedEpoch types.Epoch
|
|
want bool
|
|
}{
|
|
{&Node{}, 0, 0, true},
|
|
{&Node{}, 1, 0, false},
|
|
{&Node{}, 0, 1, false},
|
|
{&Node{finalizedEpoch: 1, justifiedEpoch: 1}, 1, 1, true},
|
|
{&Node{finalizedEpoch: 1, justifiedEpoch: 1}, 2, 2, false},
|
|
{&Node{finalizedEpoch: 3, justifiedEpoch: 4}, 4, 3, true},
|
|
}
|
|
for _, tc := range tests {
|
|
got := tc.n.viableForHead(tc.justifiedEpoch, tc.finalizedEpoch, 5)
|
|
assert.Equal(t, tc.want, got)
|
|
}
|
|
}
|
|
|
|
func TestNode_LeadsToViableHead(t *testing.T) {
|
|
f := setup(4, 3)
|
|
ctx := context.Background()
|
|
state, blkRoot, err := prepareForkchoiceState(ctx, 1, indexToHash(1), params.BeaconConfig().ZeroHash, params.BeaconConfig().ZeroHash, 1, 1)
|
|
require.NoError(t, err)
|
|
require.NoError(t, f.InsertNode(ctx, state, blkRoot))
|
|
state, blkRoot, err = prepareForkchoiceState(ctx, 2, indexToHash(2), params.BeaconConfig().ZeroHash, params.BeaconConfig().ZeroHash, 1, 1)
|
|
require.NoError(t, err)
|
|
require.NoError(t, f.InsertNode(ctx, state, blkRoot))
|
|
state, blkRoot, err = prepareForkchoiceState(ctx, 3, indexToHash(3), indexToHash(1), params.BeaconConfig().ZeroHash, 1, 1)
|
|
require.NoError(t, err)
|
|
require.NoError(t, f.InsertNode(ctx, state, blkRoot))
|
|
state, blkRoot, err = prepareForkchoiceState(ctx, 4, indexToHash(4), indexToHash(2), params.BeaconConfig().ZeroHash, 1, 1)
|
|
require.NoError(t, err)
|
|
require.NoError(t, f.InsertNode(ctx, state, blkRoot))
|
|
state, blkRoot, err = prepareForkchoiceState(ctx, 5, indexToHash(5), indexToHash(3), params.BeaconConfig().ZeroHash, 4, 3)
|
|
require.NoError(t, err)
|
|
require.NoError(t, f.InsertNode(ctx, state, blkRoot))
|
|
|
|
require.Equal(t, true, f.store.treeRootNode.leadsToViableHead(4, 3, 5))
|
|
require.Equal(t, true, f.store.nodeByRoot[indexToHash(5)].leadsToViableHead(4, 3, 5))
|
|
require.Equal(t, false, f.store.nodeByRoot[indexToHash(2)].leadsToViableHead(4, 3, 5))
|
|
require.Equal(t, false, f.store.nodeByRoot[indexToHash(4)].leadsToViableHead(4, 3, 5))
|
|
}
|
|
|
|
func TestNode_SetFullyValidated(t *testing.T) {
|
|
f := setup(1, 1)
|
|
ctx := context.Background()
|
|
storeNodes := make([]*Node, 6)
|
|
storeNodes[0] = f.store.treeRootNode
|
|
// insert blocks in the fork pattern (optimistic status in parenthesis)
|
|
//
|
|
// 0 (false) -- 1 (false) -- 2 (false) -- 3 (true) -- 4 (true)
|
|
// \
|
|
// -- 5 (true)
|
|
//
|
|
state, blkRoot, err := prepareForkchoiceState(ctx, 1, indexToHash(1), params.BeaconConfig().ZeroHash, params.BeaconConfig().ZeroHash, 1, 1)
|
|
require.NoError(t, err)
|
|
require.NoError(t, f.InsertNode(ctx, state, blkRoot))
|
|
storeNodes[1] = f.store.nodeByRoot[blkRoot]
|
|
require.NoError(t, f.SetOptimisticToValid(ctx, params.BeaconConfig().ZeroHash))
|
|
state, blkRoot, err = prepareForkchoiceState(ctx, 2, indexToHash(2), indexToHash(1), params.BeaconConfig().ZeroHash, 1, 1)
|
|
require.NoError(t, err)
|
|
require.NoError(t, f.InsertNode(ctx, state, blkRoot))
|
|
storeNodes[2] = f.store.nodeByRoot[blkRoot]
|
|
require.NoError(t, f.SetOptimisticToValid(ctx, indexToHash(1)))
|
|
state, blkRoot, err = prepareForkchoiceState(ctx, 3, indexToHash(3), indexToHash(2), params.BeaconConfig().ZeroHash, 1, 1)
|
|
require.NoError(t, err)
|
|
require.NoError(t, f.InsertNode(ctx, state, blkRoot))
|
|
storeNodes[3] = f.store.nodeByRoot[blkRoot]
|
|
state, blkRoot, err = prepareForkchoiceState(ctx, 4, indexToHash(4), indexToHash(3), params.BeaconConfig().ZeroHash, 1, 1)
|
|
require.NoError(t, err)
|
|
require.NoError(t, f.InsertNode(ctx, state, blkRoot))
|
|
storeNodes[4] = f.store.nodeByRoot[blkRoot]
|
|
state, blkRoot, err = prepareForkchoiceState(ctx, 5, indexToHash(5), indexToHash(1), params.BeaconConfig().ZeroHash, 1, 1)
|
|
require.NoError(t, err)
|
|
require.NoError(t, f.InsertNode(ctx, state, blkRoot))
|
|
storeNodes[5] = f.store.nodeByRoot[blkRoot]
|
|
|
|
opt, err := f.IsOptimistic(indexToHash(5))
|
|
require.NoError(t, err)
|
|
require.Equal(t, true, opt)
|
|
|
|
opt, err = f.IsOptimistic(indexToHash(4))
|
|
require.NoError(t, err)
|
|
require.Equal(t, true, opt)
|
|
|
|
require.NoError(t, f.store.nodeByRoot[indexToHash(4)].setNodeAndParentValidated(ctx))
|
|
|
|
// block 5 should still be optimistic
|
|
opt, err = f.IsOptimistic(indexToHash(5))
|
|
require.NoError(t, err)
|
|
require.Equal(t, true, opt)
|
|
|
|
// block 4 and 3 should now be valid
|
|
opt, err = f.IsOptimistic(indexToHash(4))
|
|
require.NoError(t, err)
|
|
require.Equal(t, false, opt)
|
|
|
|
opt, err = f.IsOptimistic(indexToHash(3))
|
|
require.NoError(t, err)
|
|
require.Equal(t, false, opt)
|
|
|
|
respNodes := make([]*v1.ForkChoiceNode, 0)
|
|
respNodes, err = f.store.treeRootNode.nodeTreeDump(ctx, respNodes)
|
|
require.NoError(t, err)
|
|
require.Equal(t, len(respNodes), f.NodeCount())
|
|
|
|
for i, respNode := range respNodes {
|
|
require.Equal(t, storeNodes[i].slot, respNode.Slot)
|
|
require.DeepEqual(t, storeNodes[i].root[:], respNode.BlockRoot)
|
|
require.Equal(t, storeNodes[i].balance, respNode.Balance)
|
|
require.Equal(t, storeNodes[i].weight, respNode.Weight)
|
|
require.Equal(t, storeNodes[i].optimistic, respNode.ExecutionOptimistic)
|
|
require.Equal(t, storeNodes[i].justifiedEpoch, respNode.JustifiedEpoch)
|
|
require.Equal(t, storeNodes[i].unrealizedJustifiedEpoch, respNode.UnrealizedJustifiedEpoch)
|
|
require.Equal(t, storeNodes[i].finalizedEpoch, respNode.FinalizedEpoch)
|
|
require.Equal(t, storeNodes[i].unrealizedFinalizedEpoch, respNode.UnrealizedFinalizedEpoch)
|
|
require.Equal(t, storeNodes[i].timestamp, respNode.Timestamp)
|
|
}
|
|
}
|
|
|
|
func TestStore_VotedFraction(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))
|
|
|
|
// No division by zero error
|
|
vote, err := f.VotedFraction([32]byte{'b'})
|
|
require.NoError(t, err)
|
|
require.Equal(t, uint64(0), vote)
|
|
|
|
// Zero balance in the node
|
|
f.store.committeeBalance = 100 * params.BeaconConfig().MaxEffectiveBalance
|
|
vote, err = f.VotedFraction([32]byte{'b'})
|
|
require.NoError(t, err)
|
|
require.Equal(t, uint64(0), vote)
|
|
|
|
// Attestations are not counted until we process Head
|
|
balances := []uint64{params.BeaconConfig().MaxEffectiveBalance, params.BeaconConfig().MaxEffectiveBalance}
|
|
_, err = f.Head(context.Background(), balances)
|
|
require.NoError(t, err)
|
|
f.ProcessAttestation(context.Background(), []uint64{0, 1}, [32]byte{'b'}, 2)
|
|
vote, err = f.VotedFraction([32]byte{'b'})
|
|
require.NoError(t, err)
|
|
require.Equal(t, uint64(0), vote)
|
|
|
|
// After we call head the voted fraction is obtained.
|
|
_, err = f.Head(context.Background(), balances)
|
|
require.NoError(t, err)
|
|
vote, err = f.VotedFraction([32]byte{'b'})
|
|
require.NoError(t, err)
|
|
require.Equal(t, uint64(2), vote)
|
|
|
|
// Check for non-existent root
|
|
_, err = f.VotedFraction([32]byte{'c'})
|
|
require.ErrorIs(t, err, ErrNilNode)
|
|
}
|