package trie_test import ( "strconv" "testing" "github.com/ethereum/go-ethereum/accounts/abi/bind" "github.com/prysmaticlabs/prysm/config/params" "github.com/prysmaticlabs/prysm/container/trie" contracts "github.com/prysmaticlabs/prysm/contracts/deposit" "github.com/prysmaticlabs/prysm/crypto/hash" "github.com/prysmaticlabs/prysm/encoding/bytesutil" ethpb "github.com/prysmaticlabs/prysm/proto/prysm/v1alpha1" "github.com/prysmaticlabs/prysm/testing/assert" "github.com/prysmaticlabs/prysm/testing/require" ) func TestMarshalDepositWithProof(t *testing.T) { items := [][]byte{ []byte("A"), []byte("BB"), []byte("CCC"), []byte("DDDD"), []byte("EEEEE"), []byte("FFFFFF"), []byte("GGGGGGG"), } m, err := trie.GenerateTrieFromItems(items, params.BeaconConfig().DepositContractTreeDepth) require.NoError(t, err) proof, err := m.MerkleProof(2) require.NoError(t, err) require.Equal(t, len(proof), int(params.BeaconConfig().DepositContractTreeDepth)+1) someRoot := [32]byte{1, 2, 3, 4} someSig := [96]byte{1, 2, 3, 4} someKey := [48]byte{1, 2, 3, 4} dep := ðpb.Deposit{ Proof: proof, Data: ðpb.Deposit_Data{ PublicKey: someKey[:], WithdrawalCredentials: someRoot[:], Amount: 32, Signature: someSig[:], }, } enc, err := dep.MarshalSSZ() require.NoError(t, err) dec := ðpb.Deposit{} require.NoError(t, dec.UnmarshalSSZ(enc)) require.DeepEqual(t, dec, dep) } func TestMerkleTrie_MerkleProofOutOfRange(t *testing.T) { h := hash.Hash([]byte("hi")) m := trie.CreateTrieFromProto(ðpb.SparseMerkleTrie{ Layers: []*ethpb.TrieLayer{ { Layer: [][]byte{h[:]}, }, { Layer: [][]byte{h[:]}, }, { Layer: [][]byte{}, }, }, Depth: 4, }) if _, err := m.MerkleProof(6); err == nil { t.Error("Expected out of range failure, received nil", err) } } func TestMerkleTrieRoot_EmptyTrie(t *testing.T) { trie, err := trie.NewTrie(params.BeaconConfig().DepositContractTreeDepth) require.NoError(t, err) testAccount, err := contracts.Setup() require.NoError(t, err) depRoot, err := testAccount.Contract.GetDepositRoot(&bind.CallOpts{}) require.NoError(t, err) require.DeepEqual(t, depRoot, trie.HashTreeRoot()) } func TestGenerateTrieFromItems_NoItemsProvided(t *testing.T) { if _, err := trie.GenerateTrieFromItems(nil, params.BeaconConfig().DepositContractTreeDepth); err == nil { t.Error("Expected error when providing nil items received nil") } } func TestMerkleTrie_VerifyMerkleProof(t *testing.T) { items := [][]byte{ []byte("A"), []byte("B"), []byte("C"), []byte("D"), []byte("E"), []byte("F"), []byte("G"), []byte("H"), } m, err := trie.GenerateTrieFromItems(items, params.BeaconConfig().DepositContractTreeDepth) require.NoError(t, err) proof, err := m.MerkleProof(0) require.NoError(t, err) require.Equal(t, int(params.BeaconConfig().DepositContractTreeDepth)+1, len(proof)) root := m.HashTreeRoot() if ok := trie.VerifyMerkleBranch(root[:], items[0], 0, proof, params.BeaconConfig().DepositContractTreeDepth); !ok { t.Error("First Merkle proof did not verify") } proof, err = m.MerkleProof(3) require.NoError(t, err) require.Equal(t, true, trie.VerifyMerkleBranch(root[:], items[3], 3, proof, params.BeaconConfig().DepositContractTreeDepth)) require.Equal(t, false, trie.VerifyMerkleBranch(root[:], []byte("buzz"), 3, proof, params.BeaconConfig().DepositContractTreeDepth)) } func TestMerkleTrie_NegativeIndexes(t *testing.T) { items := [][]byte{ []byte("A"), []byte("B"), []byte("C"), []byte("D"), []byte("E"), []byte("F"), []byte("G"), []byte("H"), } m, err := trie.GenerateTrieFromItems(items, params.BeaconConfig().DepositContractTreeDepth) require.NoError(t, err) _, err = m.MerkleProof(-1) require.ErrorContains(t, "merkle index is negative", err) require.ErrorContains(t, "negative index provided", m.Insert([]byte{'J'}, -1)) } func TestMerkleTrie_VerifyMerkleProof_TrieUpdated(t *testing.T) { items := [][]byte{ {1}, {2}, {3}, {4}, } depth := params.BeaconConfig().DepositContractTreeDepth + 1 m, err := trie.GenerateTrieFromItems(items, depth) require.NoError(t, err) proof, err := m.MerkleProof(0) require.NoError(t, err) root := m.HashTreeRoot() require.Equal(t, true, trie.VerifyMerkleBranch(root[:], items[0], 0, proof, depth)) // Now we update the trie. assert.NoError(t, m.Insert([]byte{5}, 3)) proof, err = m.MerkleProof(3) require.NoError(t, err) root = m.HashTreeRoot() if ok := trie.VerifyMerkleBranch(root[:], []byte{5}, 3, proof, depth); !ok { t.Error("Second Merkle proof did not verify") } if ok := trie.VerifyMerkleBranch(root[:], []byte{4}, 3, proof, depth); ok { t.Error("Old item should not verify") } // Now we update the trie at an index larger than the number of items. assert.NoError(t, m.Insert([]byte{6}, 15)) } func TestRoundtripProto_OK(t *testing.T) { items := [][]byte{ {1}, {2}, {3}, {4}, } m, err := trie.GenerateTrieFromItems(items, params.BeaconConfig().DepositContractTreeDepth+1) require.NoError(t, err) protoTrie := m.ToProto() depositRoot := m.HashTreeRoot() newTrie := trie.CreateTrieFromProto(protoTrie) require.DeepEqual(t, depositRoot, newTrie.HashTreeRoot()) } func TestCopy_OK(t *testing.T) { items := [][]byte{ {1}, {2}, {3}, {4}, } source, err := trie.GenerateTrieFromItems(items, params.BeaconConfig().DepositContractTreeDepth+1) require.NoError(t, err) copiedTrie := source.Copy() if copiedTrie == source { t.Errorf("Original trie returned.") } copyHash := copiedTrie.HashTreeRoot() require.DeepEqual(t, copyHash, copiedTrie.HashTreeRoot()) } func BenchmarkGenerateTrieFromItems(b *testing.B) { items := [][]byte{ []byte("A"), []byte("BB"), []byte("CCC"), []byte("DDDD"), []byte("EEEEE"), []byte("FFFFFF"), []byte("GGGGGGG"), } for i := 0; i < b.N; i++ { _, err := trie.GenerateTrieFromItems(items, params.BeaconConfig().DepositContractTreeDepth) require.NoError(b, err, "Could not generate Merkle trie from items") } } func BenchmarkInsertTrie_Optimized(b *testing.B) { b.StopTimer() numDeposits := 16000 items := make([][]byte, numDeposits) for i := 0; i < numDeposits; i++ { someRoot := bytesutil.ToBytes32([]byte(strconv.Itoa(i))) items[i] = someRoot[:] } tr, err := trie.GenerateTrieFromItems(items, params.BeaconConfig().DepositContractTreeDepth) require.NoError(b, err) someItem := bytesutil.ToBytes32([]byte("hello-world")) b.StartTimer() for i := 0; i < b.N; i++ { require.NoError(b, tr.Insert(someItem[:], i%numDeposits)) } } func BenchmarkGenerateProof(b *testing.B) { b.StopTimer() items := [][]byte{ []byte("A"), []byte("BB"), []byte("CCC"), []byte("DDDD"), []byte("EEEEE"), []byte("FFFFFF"), []byte("GGGGGGG"), } normalTrie, err := trie.GenerateTrieFromItems(items, params.BeaconConfig().DepositContractTreeDepth) require.NoError(b, err) b.StartTimer() for i := 0; i < b.N; i++ { _, err := normalTrie.MerkleProof(3) require.NoError(b, err) } } func BenchmarkVerifyMerkleBranch(b *testing.B) { b.StopTimer() items := [][]byte{ []byte("A"), []byte("BB"), []byte("CCC"), []byte("DDDD"), []byte("EEEEE"), []byte("FFFFFF"), []byte("GGGGGGG"), } m, err := trie.GenerateTrieFromItems(items, params.BeaconConfig().DepositContractTreeDepth) require.NoError(b, err) proof, err := m.MerkleProof(2) require.NoError(b, err) root := m.HashTreeRoot() b.StartTimer() for i := 0; i < b.N; i++ { if ok := trie.VerifyMerkleBranch(root[:], items[2], 2, proof, params.BeaconConfig().DepositContractTreeDepth); !ok { b.Error("Merkle proof did not verify") } } }