A Merkle Patricia Trie (MPT), sometimes written Merkle Patricia tree, is the data structure Ethereum uses to store its state, transactions and receipts. It combines a Patricia trie, a compressed radix tree in which each key is spelled out as a path, with a Merkle tree, so every node is referenced by its hash, computed with Keccak-256. Any change to an account balance or to contract storage changes the hashes all the way up to a single root.
Each block header carries three such roots: the state root, the transactions root and the receipts root, and each contract keeps its own storage trie. A light node can check a balance against the state root with a short Merkle proof instead of downloading the whole state. Because these proofs are still fairly large, developers have proposed replacing the structure with Verkle trees or binary hash trees to make stateless clients practical.
Ref 1070001400