Skip to main content
4 votes
Accepted

Why does ethereum need a trie for key-value lookups?

Tries are not related to the lookups, but to how the blockchain operates. Each block must hash the Ethereum virtual machine state to a single hash at the end of the block. Merkle tree makes updating ...
Mikko Ohtamaa's user avatar
3 votes

Why does ethereum need a trie for key-value lookups?

If we had a simple table with key-value pairs, reading data was easy and quick with a complexity of 1. However, because we need to create a hash of the entire database, updating the data becomes more ...
Ehsan's user avatar
  • 80
2 votes

To what extent has 2018 mLSM paper influenced ethereum data structure?

Similar techniques are used in Firewood by Avalanche. Traditionally, projects that employ Merkle Tries have relied on existing key-value embedded databases, like LevelDB or RocksDB, to efficiently ...
Mikko Ohtamaa's user avatar
1 vote

Are nodes in Merkle Patricia Tree ever deleted?

After lots of research, here is my understanding: In general, when information is updated (like the accounts balance, or contracts variable states values), a key/value database (which implements ...
Hackndo's user avatar
  • 121

Only top scored, non community-wiki answers of a minimum length are eligible