The main idea is to use the same approach as in my previous post, but instead of using a simple hash function for hashing the data, I will use a cryptographic hash function.

The advantage of this approach is that it allows me to check if two pieces of data are identical or not without actually having to store them both. This means that I can avoid storing duplicate copies of the same piece of data and still be able to compare them efficiently.

In order to do this, we need some kind of key which we will use as input into our cryptographic hash function (in practice, you would probably want something more complex than just an integer)
https://t.co/yI1HQo849m