#perceptual #hash #fingerprint

no-std blockhash

A perceptual hashing algorithm for detecting similar images

6 releases (1 stable)

1.0.0 Apr 8, 2024
0.5.0 Sep 17, 2022
0.4.0 Mar 29, 2022
0.3.0 Aug 12, 2021
0.1.0 May 14, 2020

#109 in Images

Download history 56/week @ 2024-03-13 64/week @ 2024-03-20 60/week @ 2024-03-27 109/week @ 2024-04-03 84/week @ 2024-04-10 22/week @ 2024-04-17 28/week @ 2024-04-24 16/week @ 2024-05-01 14/week @ 2024-05-08 12/week @ 2024-05-15 8/week @ 2024-05-22 15/week @ 2024-05-29 12/week @ 2024-06-05 29/week @ 2024-06-12 32/week @ 2024-06-19 12/week @ 2024-06-26

88 downloads per month
Used in 3 crates

MIT license

779 lines


Crates.io CI status MIT License

This is an implementation of the Blockhash algorithm for detecting similar images, and can produce 16-, 64-, 144-, and 256-bit perceptual hashes.

Support for the image crate is provided by default, but support for any image type can be easily added.



use blockhash::blockhash64;

let img = image::open("images/example.png").unwrap();
let hash = blockhash64(&img);

assert_eq!(hash.to_string(), "c7c48f8989c77e0c");

The Blockhash algorithm

This is a basic outline of how the algorithm works. Note that this explanation uses floating-point numbers, but the library itself only uses integer operations in order to avoid any rounding errors.

To demonstrate the algorithm, we will calculate the 64-bit hash of the following image:

First we convert it to a grayscale image by taking the average of the red, green, and blue components:

Then we divide the image into 64 (8×8) blocks and calculate the average brightness for all the pixels in each block:

Next, we divide the blocks into 4 horizontal bands and find the median value for each band:

Blocks brighter than the median represent a 1 and blocks darker than the median represent a 0. This gives us the 64 bits of the hash, read from left to right, top to bottom:

We can represent the hash as a hexadecimal string:



This project is licensed under the MIT license.


~51K SLoC