Simple python tool to hash dictionaries using both default hash and sha256. The library comes with full support for hashing Pandas DataFrame objects, Numba objects and Numpy arrays, but you will need to specify the requirements when installing the package to avoid bloating the installation process.

Furthermore, the library supports objects that can be recursively hashed.

As we saw this library being used in the wild mostly to create caching libraries and wrappers, we'd like to point you to our library, Cache decorator.

As usual, just download it using pip:

pip install dict_hash

The package offers two functions: sha256 to generate constant sha256 hashes and dict_hash, to generate hashes using the native hash function.

Obtain a session hash from the given dictionary.

from dict_hash import dict_hash
from random_dict import random_dict
from random import randint

d = random_dict(randint(1, 10), randint(1, 10))
my_hash = dict_hash(d)

Obtain a consistent hash from the given dictionary.

from dict_hash import sha256
from random_dict import random_dict
from random import randint

d = random_dict(randint(1, 10), randint(1, 10))
my_hash = sha256(d)

All of the methods shown offer the use_approximation parameter, which allows you to switch to a more lightweight hashing procedure where supported, for the various supported objects. This procedure will randomly subsample the provided objects.

Currently, we support this parameter for NumPy and Pandas objects.

from dict_hash import sha256
from random_dict import random_dict
from random import randint

# Even though the DataFrame is very big...
df = load_a_very_big_dataframe(...)
# an approximated hash is still very fast!
my_hash = sha256(
    df,
    use_approximation=True
)

If the hashing function encounters an object that it cannot hash, it will by default raise a NotHashableException exception. You can choose whether this or other options happen by setting the behavior_on_error parameter. You can choose between:

• raise: Raise a NotHashableException exception.
• warn: Print a NotHashableWarning and continue hashing, setting the unhashable object to "Unhashable object" string.
• ignore: Ignore the object and continue hashing, setting the unhashable object to "Unhashable object" string.

In Python it is possible to have recursive objects, such as a dictionary that contains itself. When you attempt to hash such an object, the hashing function will raise a RecursionError exception, which you can customize with the maximal_recursion parameter, by default equal to 100. The RecursionError is most commonly then handled as a NotHashableException, and as such you can set the behavior_on_error parameter to handle it as you see fit.

When handling complex objects within the dictionaries, you may need to implement the class Hashable in that object.

Here is an example:

from dict_hash import Hashable, sha256

class MyHashable(Hashable):

    def __init__(self, a: int):
        self._a = a
        self._time = time()

    def consistent_hash(self) -> str:
        return sha256({
            "a": self._a
        })