I want to know the structure of storage trie and its data structure in leveldb, and I read solidity storage.
I still have questions?
In the yellow paper, it says that storage root is a mapping between 256-bit integer and 256-bit integer, is this key value pair store in leveldb?
If we want to store one value V in the storage trie of one contract. Following solidity storage, I count the key K for V, and insert V using K in the storage trie (just like K is the account address and V is the account state in the state trie). Then update the storage root just like state trie. Am I right?
If question 1 is right, what's the real key we use to store V in leveldb, is it K or K and something after SHA3? How can we get the parent hash of some leaf value nodes, just use SHA3(value1, value2, ...)?