We handle NonExisting keys as if we have recorded the value. The reason behind this is that we have recorded all the trie nodes to proof that the key doesn't exist in the trie. So, next time we want to access the key we can use the cache (if present) and do not net to iterate over the trie nodes again.
We handle
NonExisting
keys as if we have recorded the value. The reason behind this is that we have recorded all the trie nodes to proof that the key doesn't exist in thetrie
. So, next time we want to access the key we can use thecache
(if present) and do not net to iterate over the trie nodes again.