mirror of
https://gitlab.com/pulsechaincom/prysm-pulse.git
synced 2024-12-25 21:07:18 +00:00
a069738c20
* update shared/params * update eth2-types deps * update protobufs * update shared/* * fix testutil/state * update beacon-chain/state * update beacon-chain/db * update tests * fix test * update beacon-chain/core * update beacon-chain/blockchain * update beacon-chain/cache * beacon-chain/forkchoice * update beacon-chain/operations * update beacon-chain/p2p * update beacon-chain/rpc * update sync/initial-sync * update deps * update deps * go fmt * update beacon-chain/sync * update endtoend/ * bazel build //beacon-chain - works w/o issues * update slasher code * udpate tools/ * update validator/ * update fastssz * fix build * fix test building * update tests * update ethereumapis deps * fix tests * update state/stategen * fix build * fix test * add FarFutureSlot * go imports * Radek's suggestions * Ivan's suggestions * type conversions * Nishant's suggestions * add more tests to rpc_send_request * fix test * clean up * fix conflicts Co-authored-by: prylabs-bulldozer[bot] <58059840+prylabs-bulldozer[bot]@users.noreply.github.com> Co-authored-by: nisdas <nishdas93@gmail.com>
79 lines
2.1 KiB
Go
79 lines
2.1 KiB
Go
package sync
|
|
|
|
import (
|
|
"math/rand"
|
|
"testing"
|
|
|
|
types "github.com/prysmaticlabs/eth2-types"
|
|
ethpb "github.com/prysmaticlabs/ethereumapis/eth/v1alpha1"
|
|
"github.com/prysmaticlabs/prysm/shared/bytesutil"
|
|
"github.com/prysmaticlabs/prysm/shared/testutil/require"
|
|
)
|
|
|
|
func TestSortedObj_SortBlocksRoots(t *testing.T) {
|
|
source := rand.NewSource(33)
|
|
randGen := rand.New(source)
|
|
var blks []*ethpb.SignedBeaconBlock
|
|
var roots [][32]byte
|
|
randFunc := func() int64 {
|
|
return randGen.Int63n(50)
|
|
}
|
|
|
|
for i := 0; i < 10; i++ {
|
|
slot := types.Slot(randFunc())
|
|
newBlk := ðpb.SignedBeaconBlock{Block: ðpb.BeaconBlock{Slot: slot}}
|
|
blks = append(blks, newBlk)
|
|
root := bytesutil.ToBytes32(bytesutil.Bytes32(uint64(slot)))
|
|
roots = append(roots, root)
|
|
}
|
|
|
|
r := &Service{}
|
|
|
|
newBlks, newRoots := r.sortBlocksAndRoots(blks, roots)
|
|
|
|
previousSlot := types.Slot(0)
|
|
for i, b := range newBlks {
|
|
if b.Block.Slot < previousSlot {
|
|
t.Errorf("Block list is not sorted as %d is smaller than previousSlot %d", b.Block.Slot, previousSlot)
|
|
}
|
|
if bytesutil.FromBytes8(newRoots[i][:]) != uint64(b.Block.Slot) {
|
|
t.Errorf("root doesn't match stored slot in block: wanted %d but got %d", b.Block.Slot, bytesutil.FromBytes8(newRoots[i][:]))
|
|
}
|
|
previousSlot = b.Block.Slot
|
|
}
|
|
}
|
|
|
|
func TestSortedObj_NoDuplicates(t *testing.T) {
|
|
source := rand.NewSource(33)
|
|
randGen := rand.New(source)
|
|
var blks []*ethpb.SignedBeaconBlock
|
|
var roots [][32]byte
|
|
randFunc := func() int64 {
|
|
return randGen.Int63n(50)
|
|
}
|
|
|
|
for i := 0; i < 10; i++ {
|
|
slot := types.Slot(randFunc())
|
|
newBlk := ðpb.SignedBeaconBlock{Block: ðpb.BeaconBlock{Slot: slot}}
|
|
// append twice
|
|
blks = append(blks, newBlk, newBlk)
|
|
|
|
// append twice
|
|
root := bytesutil.ToBytes32(bytesutil.Bytes32(uint64(slot)))
|
|
roots = append(roots, root, root)
|
|
}
|
|
|
|
r := &Service{}
|
|
|
|
newBlks, newRoots, err := r.dedupBlocksAndRoots(blks, roots)
|
|
require.NoError(t, err)
|
|
|
|
rootMap := make(map[[32]byte]bool)
|
|
for i, b := range newBlks {
|
|
if rootMap[newRoots[i]] {
|
|
t.Errorf("Duplicated root exists %#x with block %v", newRoots[i], b)
|
|
}
|
|
rootMap[newRoots[i]] = true
|
|
}
|
|
}
|