[Feature Request]: State trie caching #2455
Description
Component
Other
Feature Description
According to our benchmarks storage access operations consume up to 42% of total execution time of the block. Therefore, we may gain drastic improvement in speed if we boost read operations.
However, to perform write and proof operations on trie, we still need to read its nodes which have O(log(n)) complexity. We will address this issue by introducing KV cache with values from the most recent state of the trie
References and additional Information
No response