forks/go-ethereum
1
0
Fork 1
mirror of https://github.com/ethereum/go-ethereum.git synced 2026-07-19 19:30:44 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 1

Update proof_test.go

Browse source
This commit is contained in:
splinter 2026-02-10 23:26:44 +01:00 committed by GitHub
parent 15a9e92bbd
commit 92df1d57dc
No known key found for this signature in database
GPG key ID: B5690EEEBB952194
1 changed files with 18 additions and 18 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

36
trie/proof_test.go
View file

@ -262,8 +262,8 @@ func TestRangeProofWithInvalidNonExistentProof(t *testing.T) {
t.Fatalf("Failed to prove the last node %v", err)
}
start = 105 // Gap created
k := make([][]byte, 0)
v := make([][]byte, 0)
k := make([][]byte, 0, end-start)
v := make([][]byte, 0, end-start)
for i := start; i < end; i++ {
k = append(k, entries[i].k)
v = append(v, entries[i].v)
@ -430,14 +430,14 @@ func TestSingleSideRangeProof(t *testing.T) {
t.Fatalf("Failed to prove the first node %v", err)
}
if err := trie.Prove(entries[pos].k, proof); err != nil {
t.Fatalf("Failed to prove the first node %v", err)
}
k := make([][]byte, 0)
v := make([][]byte, 0)
for i := 0; i <= pos; i++ {
k = append(k, entries[i].k)
v = append(v, entries[i].v)
}
t.Fatalf("Failed to prove the first node %v", err)
}
k := make([][]byte, 0, pos+1)
v := make([][]byte, 0, pos+1)
for i := 0; i <= pos; i++ {
k = append(k, entries[i].k)
v = append(v, entries[i].v)
}
_, err := VerifyRangeProof(trie.Hash(), common.Hash{}.Bytes(), k, v, proof)
if err != nil {
t.Fatalf("Expected no error, got %v", err)
@ -634,14 +634,14 @@ func TestHasRightElement(t *testing.T) {
}
}
if err := trie.Prove(entries[c.end-1].k, proof); err != nil {
t.Fatalf("Failed to prove the first node %v", err)
}
k := make([][]byte, 0)
v := make([][]byte, 0)
for i := start; i < end; i++ {
k = append(k, entries[i].k)
v = append(v, entries[i].v)
}
t.Fatalf("Failed to prove the first node %v", err)
}
k := make([][]byte, 0, end-start)
v := make([][]byte, 0, end-start)
for i := start; i < end; i++ {
k = append(k, entries[i].k)
v = append(v, entries[i].v)
}
hasMore, err := VerifyRangeProof(trie.Hash(), firstKey, k, v, proof)
if err != nil {
t.Fatalf("Expected no error, got %v", err)