This lecture dives into data structures of the Execution layer, the Merkle Patricia Tree and how different clients implement it. The lecture is given by Gary Schulte and Karim from the Besu team.
Merkle Patricia Trie (MPT): structure, trie-within-a-trie account storage, state root purpose, state size challenges
Evolution of State Solutions: From Hash Based to Path Based - forest model, Bonsai, path based trie, flat database, Nethermind half-path, Erigon/Reth flat db model