167 Open source projects that are alternatives of or similar to Sketchy

Proof of Work with SHA256 and Bloom filter

aHash is a non-cryptographic hashing algorithm that uses the AES hardware instruction

Port of Google's farmhash algorithm to .NET

Compare various different Hashing Algorithms

🔍 Tiny, full-text search engine for static websites built with Rust and Wasm

Unsupervised Deep Hashing with Similarity-Adaptive and Discrete Optimization (TPAMI2018)

MSc Module

A simple but fast bloomfilter written in Python

C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings

Bloomfilter written in Golang, includes rotation and RPC

Node.js bindings for Argon2 hashing algorithm

Analyse a forensic target (such as a directory) to find and report files found and not found from CIRCL hashlookup public service - https://circl.lu/services/hashlookup/

PyTorch implementation of Hash Embeddings (NIPS 2017). Submission to the NIPS Implementation Challenge.

Fast hash function for DNA sequences

Compute xxHash hash codes for 8 keys in parallel

A Golomb Coded Set implementation in Rust

Study group for algorithms in Ruby, hosted at App Academy

🇸Superpowered Audio, Networking and Cryptographics SDKs. High performance and cross platform on Android, iOS, macOS, tvOS, Linux, Windows and modern web browsers.

Bloom filter for Scala, the fastest for JVM

开箱即用的SpringMVC项目,包含常规业务所需的框架功能整合，更多功能请关注 https://github.com/MartinDai/SpringBoot-Project

Simplistic (but fast) java implementation of a bloom filter.

No description or website provided.

Code for papers "Hashing with Mutual Information" (TPAMI 2019) and "Hashing with Binary Matrix Pursuit" (ECCV 2018)

An advanced cryptography tool for hashing, encrypting, encoding, steganography and more.

A C++14 compile-time/constexpr map and hash map with minimal binary footprint

hashtopolis.org

I have written some important Algorithms and Data Structures in an efficient way in Java with proper references to time and space complexity. These Pre-cooked and well-tested codes help to implement larger hackathon problems in lesser time. DFS, BFS, LCA, All Pair Shortest Path, Longest Common Subsequence, Binary Search, Lower Bound Search, Maximal Matching, Matrix Exponentiation, Segment Tree, Sparse Table, Merge Sort, Miller Prime Test, Prims - Minimum Spanning Tree, BIT - Binary Index Tree, Two Pointers, BST - Binary Search Tree, Maximum Subarray Sum, Immutable Data Structures, Persistent Data Structurs - Persistent Trie, Dijkstra, Z - Function, Minimum Cost Maximal Matching, Heavy Light Decomposition, Knapsack, Suffix Array and LCP - Longest Common Prefix, Squre Root Decomposition, Kth Order Statics, Trie / Prefix Tree, LIS - Longest Increasing Subsequence, Hashing

Image comparison by hash codes

高性能的分布式的专门空间优化的 Bitmap 服务, 高效检查数据是否存在,日活统计，签到，打点等等

The VBCorLib framework brings many of the powerful .NET classes to VB6.

Cuckoo Filter implementation in Go, better than Bloom Filters (unmaintained)

A series of important questions with solutions to crack the coding interview and ace it!

C++ Bloom Filter Library

Leaked password check library with bloom filter

SirixDB is a temporal, evolutionary database system, which uses an accumulate only approach. It keeps the full history of each resource. Every commit stores a space-efficient snapshot through structural sharing. It is log-structured and never overwrites data. SirixDB uses a novel page-level versioning approach called sliding snapshot.

Codes of the paper "Adversarial Binary Coding for Efficient Person Re-identification"

Verified hash-based AMQ structures in Coq

🦀 Bloom filter implementation in Rust 🦀

library for importing functions from dlls in a hidden, reverse engineer unfriendly way

🔑 Hash type identifier (CLI & lib)

Accelerate aggregated MD5 hashing performance up to 8x for AVX512 and 4x for AVX2. Useful for server applications that need to compute many MD5 sums in parallel.

BalanceD is a Layer-4 Linux Virtual Server (LVS) based load balancing platform for Kubernetes.

Tiny hashing module that uses the native crypto API in Node.js and the browser

ganon classifies short DNA sequences against large sets of genomic sequences efficiently, with download and update of references (RefSeq/Genbank), taxonomic (NCBI/GTDB) and hierarchical classification, customized reporting and more

One of the fastest hash functions

SipHash in Java; zero-allocation and streaming implementations

📚 📈 Plug-and-play class-library project of standard Data Structures and Algorithms in C#

TLSH lib in Golang

An Android implementation of the Libsodium cryptography library. For the lazy dev.

Fast and simple application that allows you to generate and compare hashes from files and text

The FASTEST QUALITY hash function, random number generators (PRNG) and hash map.

The PasswordHasher component provides password hashing utilities.

JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash

😎 Finding duplicate images made easy!

Cuckoo Filter go implement, better than Bloom Filter, configurable and space optimized 布谷鸟过滤器的Go实现，优于布隆过滤器，可以定制化过滤器参数，并进行了空间优化

Blockchain as intended

Benchmark showing the we can randomly hash strings very quickly with good universality

Android cryptography library with SecureRandom patches.

Optimized BLAKE2 hashing implementations in C#

Must-read papers on deep learning to hash (DeepHash)