The reason you would use a hash tree, like a Merkle tree, is that it would provide a means of proving the integrity and validity of the data contained. And yet it would require very little memory or disk space or information. But I got to say, this is only the tip of the iceberg when it comes to Merkle trees. This is actually like a huge topic. It's a really interesting topic. You can dig into more of how Merkle proofs work by going to zeroknowledge.fm/soulmatestories.