Comments fixes

lib/trie/proof/generate.go

@@ -39,7 +39,7 @@ func Generate(rootHash []byte, fullKey []byte, database Database) (
 	fullKeyNibbles := codec.KeyLEToNibbles(fullKey)
 	encodedProofNodes, err = walk(rootNode, fullKeyNibbles)
 	if err != nil {
-		// Note we wrap the full key context here since find is recursive and
+		// Note we wrap the full key context here since walk is recursive and
 		// may not be aware of the initial full key.
 		return nil, fmt.Errorf("walking to node at key 0x%x: %w", fullKey, err)
 	}

lib/trie/proof/verify.go

@@ -123,7 +123,7 @@ func buildTrie(encodedProofNodes [][]byte, rootHash []byte) (t *trie.Trie, err e
 }
 
 // loadProof is a recursive function that will create all the trie paths based
-// on the mapped proofs slice starting at the root
+// on the map from node hash to node starting at the root.
 func loadProof(proofHashToNode map[string]*node.Node, n *node.Node) {
 	if n.Type() != node.Branch {
 		return

lib/trie/proof/verify_test.go

@@ -63,7 +63,7 @@ func Test_Verify(t *testing.T) {
 			encodedProofNodes: [][]byte{
 				encodeNode(t, branch),
 				encodeNode(t, leafB),
-				// TODO Note leaf A is small enough to be inlined in branch
+				// Note leaf A is small enough to be inlined in branch
 			},
 			rootHash:   blake2bNode(t, branch),
 			keyLE:      []byte{1, 1}, // nil child of branch