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

trie/bintrie: fix overflow management in slot key computation

Browse source
This commit is contained in:
Guillaume Ballet 2026-03-04 13:15:31 +01:00
parent 814edc5308
commit 8f215241a5
No known key found for this signature in database
1 changed files with 13 additions and 4 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

17
trie/bintrie/key_encoding.go
View file

@ -47,11 +47,19 @@ var (
)
func GetBinaryTreeKey(addr common.Address, key []byte) []byte {
return getBinaryTreeKey(addr, key, false)
}
func getBinaryTreeKey(addr common.Address, key []byte, overflow bool) []byte {
hasher := sha256.New()
hasher.Write(zeroHash[:12])
hasher.Write(addr[:])
hasher.Write(key[:31])
hasher.Write([]byte{0})
if overflow {
hasher.Write([]byte{1})
} else {
hasher.Write([]byte{0})
}
k := hasher.Sum(nil)
k[31] = key[31]
return k
@ -82,11 +90,12 @@ func GetBinaryTreeKeyStorageSlot(address common.Address, key []byte) []byte {
// note that the first 64 bytes of the main offset storage
// are unreachable, which is consistent with the spec and
// what verkle does.
k[0] = 1 // 1 << 248
copy(k[1:], key[:31])
copy(k[:31], key[:31])
overflow := k[0] == 255
k[0] += 1 // 1 << 248, handle overflow out of band
k[31] = key[31]
return GetBinaryTreeKey(address, k[:])
return getBinaryTreeKey(address, k[:], overflow)
}
func GetBinaryTreeKeyCodeChunk(address common.Address, chunknr *uint256.Int) []byte {