A fast way to look up the nearest hashes with hamming distance
Go to file
2022-03-23 15:25:21 -04:00
.github/workflows Bump versions, use GitHub Actions. 2021-12-08 23:31:29 -05:00
bkapi Bump versions. 2022-03-23 15:25:21 -04:00
bkapi-client Bump versions. 2022-03-23 15:25:21 -04:00
.gitignore Initial commit. 2021-07-27 22:25:53 -04:00
Cargo.lock Bump versions. 2022-03-23 15:25:21 -04:00
Cargo.toml Add client. 2021-07-28 15:43:13 -04:00
README.md Initial commit. 2021-07-27 22:25:53 -04:00

bkapi

A fast way to look up hamming distance hashes.

It operates by connecting to a PostgreSQL database (DATABASE_URL), selecting every column of a provided query (DATABASE_QUERY), subscribing to events (DATABASE_SUBSCRIBE), and holding everything in a BK tree.

It provides a single API endpoint, /search which takes in a hash and distance query parameter to search for matches.