go.mod: use github.com/holiman/bloomfilter/v2 (#22044)
* deps: use improved bloom filter implementation * eth/handler, trie: use 4 keys for syncbloom + minor fixes * eth/protocols, trie: revert change on syncbloom method signature
This commit is contained in:
committed by
GitHub
parent
23f837c388
commit
93a89b2681
@ -410,7 +410,7 @@ func (s *Sync) children(req *request, object node) ([]*request, error) {
|
||||
// Bloom filter says this might be a duplicate, double check.
|
||||
// If database says yes, then at least the trie node is present
|
||||
// and we hold the assumption that it's NOT legacy contract code.
|
||||
if blob := rawdb.ReadTrieNode(s.database, common.BytesToHash(node)); len(blob) > 0 {
|
||||
if blob := rawdb.ReadTrieNode(s.database, hash); len(blob) > 0 {
|
||||
continue
|
||||
}
|
||||
// False positive, bump fault meter
|
||||
|
Reference in New Issue
Block a user