fix: typos in documentation files

rs_zktrie/src/types.rs

@@ -112,7 +112,7 @@ pub struct Node<H: Hashable> {
     pub child_right: Option<H>,
     // key is the node's key stored in a leaf node.
     pub node_key: H,
-    // value_preimage can store at most 256 byte32 as fields (represnted by BIG-ENDIAN integer)
+    // value_preimage can store at most 256 byte32 as fields (represented by BIG-ENDIAN integer)
     // and the first 24 can be compressed (each bytes32 consider as 2 fields), in hashing the compressed
     // elemments would be calculated first
     pub value_preimage: Vec<[u8; 32]>,

src/rs_lib.rs

@@ -77,7 +77,7 @@ impl ZkTrieNode {
         self.trie_node
             .clone()
             .node_hash()
-            .expect("has caluclated")
+            .expect("has calculated")
             .as_ref()
             .try_into()
             .expect("same length")

trie/zk_trie.go

@@ -145,7 +145,7 @@ func (t *ZkTrie) Copy() *ZkTrie {
 	}
 }
 
-// Prove is a simlified calling of ProveWithDeletion
+// Prove is a simplified calling of ProveWithDeletion
 func (t *ZkTrie) Prove(key []byte, fromLevel uint, writeNode func(*Node) error) error {
 	return t.ProveWithDeletion(key, fromLevel, writeNode, nil)
 }

trie/zk_trie_node.go

@@ -99,7 +99,7 @@ type Node struct {
 	ChildR *zkt.Hash
 	// NodeKey is the node's key stored in a leaf node.
 	NodeKey *zkt.Hash
-	// ValuePreimage can store at most 256 byte32 as fields (represnted by BIG-ENDIAN integer)
+	// ValuePreimage can store at most 256 byte32 as fields (represented by BIG-ENDIAN integer)
 	// and the first 24 can be compressed (each bytes32 consider as 2 fields), in hashing the compressed
 	// elemments would be calculated first
 	ValuePreimage []zkt.Byte32