tidy

NethermindEth · Jun 12, 2024 · 15cfce1 · 15cfce1
1 parent 4cbfcc1
commit 15cfce1
Show file tree

Hide file tree

Showing 2 changed files with 2 additions and 4 deletions.
diff --git a/core/trie/node.go b/core/trie/node.go
@@ -12,8 +12,8 @@ type Node struct {
 	Value     *felt.Felt
 	Left      *Key
 	Right     *Key
-	LeftHash  *felt.Felt // To verify proofs, we need to store the hash of children
-	RightHash *felt.Felt // even when we can't derive their key
+	LeftHash  *felt.Felt
+	RightHash *felt.Felt
 }
 
 // Hash calculates the hash of a [Node]

diff --git a/core/trie/proof.go b/core/trie/proof.go
@@ -46,7 +46,6 @@ func (pn *ProofNode) PrettyPrint() {
 		fmt.Printf("  Edge:\n")
 		fmt.Printf("    Child: %v\n", pn.Edge.Child)
 		fmt.Printf("    Path: %v\n", pn.Edge.Path)
-		fmt.Printf("    Value: %v\n", pn.Edge.Value)
 	}
 }
 
@@ -58,7 +57,6 @@ type Binary struct {
 type Edge struct {
 	Child *felt.Felt // child hash
 	Path  *Key       // path from parent to child
-	Value *felt.Felt // this nodes hash
 }
 
 func GetBoundaryProofs(leftBoundary, rightBoundary *Key, tri *Trie) ([2][]ProofNode, error) {