From 92a9aaf542700f383b4ed4ebc4198df50244b696 Mon Sep 17 00:00:00 2001
From: Guillaume Ballet <3272758+gballet@users.noreply.github.com>
Date: Fri, 24 Apr 2026 17:41:18 +0200
Subject: [PATCH] review feedback: simplify comment

---
 trie/bintrie/store_commit.go | 5 +----
 1 file changed, 1 insertion(+), 4 deletions(-)

diff --git a/trie/bintrie/store_commit.go b/trie/bintrie/store_commit.go
index c780782107..e6d8230612 100644
--- a/trie/bintrie/store_commit.go
+++ b/trie/bintrie/store_commit.go
@@ -251,10 +251,7 @@ func (s *nodeStore) deserializeSubtree(hn common.Hash, remainingDepth int, posit
 	rightPos := position*2 + 1
 
 	// note that the parent might not need root computations, but the children
-	// do, because their hash isn't saved. This will incur more hash computations
-	// than if it's a single node, but as long as it's sha256 or blake3, that isn't
-	// a problem. If the parent isn't modified, it won't be recomputed and neither
-	// will the children.
+	// do, because their hash isn't saved. Hence `mustRecompute` is set to `true`.
 	left, err := s.deserializeSubtree(common.Hash{}, remainingDepth-1, leftPos, nodeDepth+1, bitmap, hashData, hashIdx, true, dirty)
 	if err != nil {
 		return emptyRef, err