Vitalik: Merkle trees cannot generate valid proofs for different data at the same position.

Techub News, @VitalikButerin tweeted an explanation of a cryptographic theorem, stating that the only way to generate proofs for two different pieces of data at the same position in the same Merkle tree is to break the underlying hash function. He said that reviewers do not need to verify the specific implementation of the Merkle branch or the theorem proof process. This theorem clarifies the security foundation of blockchain data structures, emphasizing the critical role of hash function collision resistance in ensuring data immutability. This technical principle is an important theoretical support for blockchains such as Ethereum to ensure the integrity of transaction history and state data.