prysm-pulse/beacon-chain/state/state-native/proofs_test.go
2022-09-15 20:47:51 +02:00

167 lines
6.1 KiB
Go

package state_native_test
import (
"context"
"testing"
"github.com/ethereum/go-ethereum/common/hexutil"
statenative "github.com/prysmaticlabs/prysm/v3/beacon-chain/state/state-native"
"github.com/prysmaticlabs/prysm/v3/container/trie"
"github.com/prysmaticlabs/prysm/v3/testing/require"
"github.com/prysmaticlabs/prysm/v3/testing/util"
)
func TestBeaconStateMerkleProofs_phase0_notsupported(t *testing.T) {
ctx := context.Background()
st, _ := util.DeterministicGenesisState(t, 256)
t.Run("current sync committee", func(t *testing.T) {
_, err := st.CurrentSyncCommitteeProof(ctx)
require.ErrorContains(t, "not supported", err)
})
t.Run("next sync committee", func(t *testing.T) {
_, err := st.NextSyncCommitteeProof(ctx)
require.ErrorContains(t, "not supported", err)
})
t.Run("finalized root", func(t *testing.T) {
_, err := st.FinalizedRootProof(ctx)
require.ErrorContains(t, "not supported", err)
})
}
func TestBeaconStateMerkleProofs_altair(t *testing.T) {
ctx := context.Background()
altair, err := util.NewBeaconStateAltair()
require.NoError(t, err)
htr, err := altair.HashTreeRoot(ctx)
require.NoError(t, err)
results := []string{
"0x173669ae8794c057def63b20372114a628abb029354a2ef50d7a1aaa9a3dab4a",
"0xe8facaa9be1c488207092f135ca6159f7998f313459b4198f46a9433f8b346e6",
"0x0a7910590f2a08faa740a5c40e919722b80a786d18d146318309926a6b2ab95e",
"0xc78009fdf07fc56a11f122370658a353aaa542ed63e44c4bc15ff4cd105ab33c",
"0x4616e1d9312a92eb228e8cd5483fa1fca64d99781d62129bc53718d194b98c45",
}
t.Run("current sync committee", func(t *testing.T) {
cscp, err := altair.CurrentSyncCommitteeProof(ctx)
require.NoError(t, err)
require.Equal(t, len(cscp), 5)
for i, bytes := range cscp {
require.Equal(t, hexutil.Encode(bytes), results[i])
}
})
t.Run("next sync committee", func(t *testing.T) {
nscp, err := altair.NextSyncCommitteeProof(ctx)
require.NoError(t, err)
require.Equal(t, len(nscp), 5)
for i, bytes := range nscp {
require.Equal(t, hexutil.Encode(bytes), results[i])
}
})
t.Run("finalized root", func(t *testing.T) {
finalizedRoot := altair.FinalizedCheckpoint().Root
proof, err := altair.FinalizedRootProof(ctx)
require.NoError(t, err)
gIndex := statenative.FinalizedRootGeneralizedIndex()
valid := trie.VerifyMerkleProof(htr[:], finalizedRoot, gIndex, proof)
require.Equal(t, true, valid)
})
t.Run("recomputes root on dirty fields", func(t *testing.T) {
currentRoot, err := altair.HashTreeRoot(ctx)
require.NoError(t, err)
cpt := altair.FinalizedCheckpoint()
require.NoError(t, err)
// Edit the checkpoint.
cpt.Epoch = 100
require.NoError(t, altair.SetFinalizedCheckpoint(cpt))
// Produce a proof for the finalized root.
proof, err := altair.FinalizedRootProof(ctx)
require.NoError(t, err)
// We expect the previous step to have triggered
// a recomputation of dirty fields in the beacon state, resulting
// in a new hash tree root as the finalized checkpoint had previously
// changed and should have been marked as a dirty state field.
// The proof validity should be false for the old root, but true for the new.
finalizedRoot := altair.FinalizedCheckpoint().Root
gIndex := statenative.FinalizedRootGeneralizedIndex()
valid := trie.VerifyMerkleProof(currentRoot[:], finalizedRoot, gIndex, proof)
require.Equal(t, false, valid)
newRoot, err := altair.HashTreeRoot(ctx)
require.NoError(t, err)
valid = trie.VerifyMerkleProof(newRoot[:], finalizedRoot, gIndex, proof)
require.Equal(t, true, valid)
})
}
func TestBeaconStateMerkleProofs_bellatrix(t *testing.T) {
ctx := context.Background()
bellatrix, err := util.NewBeaconStateBellatrix()
require.NoError(t, err)
htr, err := bellatrix.HashTreeRoot(ctx)
require.NoError(t, err)
results := []string{
"0x173669ae8794c057def63b20372114a628abb029354a2ef50d7a1aaa9a3dab4a",
"0xe8facaa9be1c488207092f135ca6159f7998f313459b4198f46a9433f8b346e6",
"0x0a7910590f2a08faa740a5c40e919722b80a786d18d146318309926a6b2ab95e",
"0xa83dc5a6222b6e5d5f11115ec4ba4035512c060e74908c56ebc25ad74dd25c18",
"0x4616e1d9312a92eb228e8cd5483fa1fca64d99781d62129bc53718d194b98c45",
}
t.Run("current sync committee", func(t *testing.T) {
cscp, err := bellatrix.CurrentSyncCommitteeProof(ctx)
require.NoError(t, err)
require.Equal(t, len(cscp), 5)
for i, bytes := range cscp {
require.Equal(t, hexutil.Encode(bytes), results[i])
}
})
t.Run("next sync committee", func(t *testing.T) {
nscp, err := bellatrix.NextSyncCommitteeProof(ctx)
require.NoError(t, err)
require.Equal(t, len(nscp), 5)
for i, bytes := range nscp {
require.Equal(t, hexutil.Encode(bytes), results[i])
}
})
t.Run("finalized root", func(t *testing.T) {
finalizedRoot := bellatrix.FinalizedCheckpoint().Root
proof, err := bellatrix.FinalizedRootProof(ctx)
require.NoError(t, err)
gIndex := statenative.FinalizedRootGeneralizedIndex()
valid := trie.VerifyMerkleProof(htr[:], finalizedRoot, gIndex, proof)
require.Equal(t, true, valid)
})
t.Run("recomputes root on dirty fields", func(t *testing.T) {
currentRoot, err := bellatrix.HashTreeRoot(ctx)
require.NoError(t, err)
cpt := bellatrix.FinalizedCheckpoint()
require.NoError(t, err)
// Edit the checkpoint.
cpt.Epoch = 100
require.NoError(t, bellatrix.SetFinalizedCheckpoint(cpt))
// Produce a proof for the finalized root.
proof, err := bellatrix.FinalizedRootProof(ctx)
require.NoError(t, err)
// We expect the previous step to have triggered
// a recomputation of dirty fields in the beacon state, resulting
// in a new hash tree root as the finalized checkpoint had previously
// changed and should have been marked as a dirty state field.
// The proof validity should be false for the old root, but true for the new.
finalizedRoot := bellatrix.FinalizedCheckpoint().Root
gIndex := statenative.FinalizedRootGeneralizedIndex()
valid := trie.VerifyMerkleProof(currentRoot[:], finalizedRoot, gIndex, proof)
require.Equal(t, false, valid)
newRoot, err := bellatrix.HashTreeRoot(ctx)
require.NoError(t, err)
valid = trie.VerifyMerkleProof(newRoot[:], finalizedRoot, gIndex, proof)
require.Equal(t, true, valid)
})
}