From 2414861d36a23b7ddf91275d7a95bcdac636a0f4 Mon Sep 17 00:00:00 2001
From: cui <cuiweixie@gmail.com>
Date: Tue, 14 Apr 2026 21:39:42 +0800
Subject: [PATCH] core/state: optimize transient storage (#33695)

Optimizes the transient storage. Turns it from a map of maps into a single map keyed by <account,slot>.
---
 core/state/statedb_test.go      |  2 +-
 core/state/transient_storage.go | 56 +++++++++++++++------------------
 2 files changed, 27 insertions(+), 31 deletions(-)

diff --git a/core/state/statedb_test.go b/core/state/statedb_test.go
index d29b262eea..680602631e 100644
--- a/core/state/statedb_test.go
+++ b/core/state/statedb_test.go
@@ -641,7 +641,7 @@ func (test *snapshotTest) checkEqual(state, checkstate *StateDB) error {
 		{
 			have := state.transientStorage
 			want := checkstate.transientStorage
-			if !maps.EqualFunc(have, want, maps.Equal) {
+			if !maps.Equal(have, want) {
 				return fmt.Errorf("transient storage differs ,have\n%v\nwant\n%v",
 					have.PrettyPrint(),
 					want.PrettyPrint())
diff --git a/core/state/transient_storage.go b/core/state/transient_storage.go
index 3bb4955425..a3cfaceb3e 100644
--- a/core/state/transient_storage.go
+++ b/core/state/transient_storage.go
@@ -25,8 +25,13 @@ import (
 	"github.com/ethereum/go-ethereum/common"
 )
 
+type transientStorageKey struct {
+	addr common.Address
+	key  common.Hash
+}
+
 // transientStorage is a representation of EIP-1153 "Transient Storage".
-type transientStorage map[common.Address]Storage
+type transientStorage map[transientStorageKey]common.Hash
 
 // newTransientStorage creates a new instance of a transientStorage.
 func newTransientStorage() transientStorage {
@@ -35,52 +40,43 @@ func newTransientStorage() transientStorage {
 
 // Set sets the transient-storage `value` for `key` at the given `addr`.
 func (t transientStorage) Set(addr common.Address, key, value common.Hash) {
+	tsKey := transientStorageKey{addr: addr, key: key}
 	if value == (common.Hash{}) { // this is a 'delete'
-		if _, ok := t[addr]; ok {
-			delete(t[addr], key)
-			if len(t[addr]) == 0 {
-				delete(t, addr)
-			}
-		}
+		delete(t, tsKey)
 	} else {
-		if _, ok := t[addr]; !ok {
-			t[addr] = make(Storage)
-		}
-		t[addr][key] = value
+		t[tsKey] = value
 	}
 }
 
 // Get gets the transient storage for `key` at the given `addr`.
 func (t transientStorage) Get(addr common.Address, key common.Hash) common.Hash {
-	val, ok := t[addr]
-	if !ok {
-		return common.Hash{}
-	}
-	return val[key]
+	tsKey := transientStorageKey{addr: addr, key: key}
+	return t[tsKey]
 }
 
 // Copy does a deep copy of the transientStorage
 func (t transientStorage) Copy() transientStorage {
-	storage := make(transientStorage)
-	for key, value := range t {
-		storage[key] = value.Copy()
-	}
-	return storage
+	return maps.Clone(t)
 }
 
 // PrettyPrint prints the contents of the access list in a human-readable form
 func (t transientStorage) PrettyPrint() string {
 	out := new(strings.Builder)
-	sortedAddrs := slices.Collect(maps.Keys(t))
-	slices.SortFunc(sortedAddrs, common.Address.Cmp)
+	sortedTSKeys := slices.Collect(maps.Keys(t))
+	slices.SortFunc(sortedTSKeys, func(a, b transientStorageKey) int {
+		r := a.addr.Cmp(b.addr)
+		if r != 0 {
+			return r
+		}
+		return a.key.Cmp(b.key)
+	})
 
-	for _, addr := range sortedAddrs {
-		fmt.Fprintf(out, "%#x:", addr)
-		storage := t[addr]
-		sortedKeys := slices.Collect(maps.Keys(storage))
-		slices.SortFunc(sortedKeys, common.Hash.Cmp)
-		for _, key := range sortedKeys {
-			fmt.Fprintf(out, "  %X : %X\n", key, storage[key])
+	for i := 0; i < len(sortedTSKeys); {
+		tsKey := sortedTSKeys[i]
+		fmt.Fprintf(out, "%#x:", tsKey.addr)
+		for ; i < len(sortedTSKeys) && sortedTSKeys[i].addr == tsKey.addr; i++ {
+			tsKey2 := sortedTSKeys[i]
+			fmt.Fprintf(out, "  %X : %X\n", tsKey2.key, t[tsKey2])
 		}
 	}
 	return out.String()