Had a very productive flight back from Copenhagen (thanks to the fact that the seat next to me was empty)! Managed to figure out a mathematical model that explains why MegaETH's new state trie data structure is scalable while MPT and its variants are not, however optimized their implementations are. This includes Verkle tries which were given quite some hope in speeding up state root update, as well as the various DBs optimized for MPT. I picked up the technique used in the analysis – approximating a random process with exploding state space using a memoryless process – when working on the rateless IBLT paper. It's an elementary technique, but it feels very fulfilling to successfully use the technique somewhere else! I will introduce the new data structure at the Science and Engineering of Consensus workshop ( during SBC. It will be the first time we talk about it in details even though it has been in prod on the testnet since day 1 : ) See you there!

@ODesenfans The insight here is that Radix tries a la MPT and Verkle are not on the Pareto frontier of arity vs. depth trade off.