Make proof to hold only hash of the value

[junha1]

Current implementation composes a proof with an actual value in it.
Thus proof grows larger as the value does.
We can optimize this by taking hash of value only.

[junha1]

Also, we can make it possible to verify the proof knowing only the hash of the value. This is an optional optimization, and will possibly change the trie structure.