feat(pkg/trie): Add TrieCache for trie values and nodes

[dimartiro]

Changes

This PR introduces a TrieCache an LRU cache to reduce latency during trie lookups.

This implementation represents the simplest form of cache. In the future, we could consider a more complex one like parity does using different caches for different purposes, such as SharedTrieCache, LocalTrieCache, and TrieCache.
These could serve as inspiration for future enhancements to our caching strategy.
For further details, see Parity's cache implementation.

Summary of changes

• New TrieCache interface
• In-memory trie cache implementation
  • Tests
• Start using TrieCache in TrieDB
  • Tests
• Add benchmarking without cache vs with cache

Tests

make test

Benchmarks

Benchmark	Iterations	time / op	bytes / op	allocs / op
get_value_without_cache-12	208468	5960 ns/op	5609 B/op	167 allocs/op
get_value_with_cache-12	8990666	132.4 ns/op	116 B/op	4 allocs/op
iterate_all_entries_without_cache-12	32265	37454 ns/op	34783 B/op	1053 allocs/op
iterate_all_entries_with_cache-12	127227	9784 ns/op	7794 B/op	280 allocs/op

Issues

closes: #3623

Primary Reviewer

@EclesioMeloJunior

[EclesioMeloJunior]

LGTM