Tootfinder

from my link log —
MuseAir: A portable hashing algorithm that heavily optimized for performance and quality, incorporating structures never before implemented.
https://github.com/eternal-io/museair
saved 2025-12-18

GitHub - eternal-io/museair: A portable hashing algorithm that heavily optimized for performance and quality, incorporating structures never before implemented.
A portable hashing algorithm that heavily optimized for performance and quality, incorporating structures never before implemented. - eternal-io/museair

»The Privacy Theater of Hashed PII:
A 2020 MacBook Air can hash every North American phone number in four hours«
Good article that clearly shows that only hashing alone is not yet data safe. That's where HMAC belongs at the SHA-2 min. but also not to save passwords and the same.
🤷 https://

The Privacy Theater of Hashed PII
It takes a 2020 Macbook Air four hours to hash every North American phone number

from my link log —
Cuckoo hashing improves SIMD hash tables.
https://reiner.org/cuckoo-hashing
saved 2025-10-04 https://dotat.at/:/6GT24.html

Cuckoo hashing improves SIMD hash tables
Benchmarks and theoretical explanation of why and when cuckoo hashing beats sort beats hash tables.

from my link log —
A new approach to analyzing Robin Hood hashing. (2014)
https://arxiv.org/abs/1401.7616
saved 2025-10-05 https://dotat.at/:/HOGQW.html…

A New Approach to Analyzing Robin Hood Hashing
Robin Hood hashing is a variation on open addressing hashing designed to reduce the maximum search time as well as the variance in the search time for elements in the hash table. While the case of insertions only using Robin Hood hashing is well understood, the behavior with deletions has remained open. Here we show that Robin Hood hashing can be analyzed under the framework of finite-level finite-dimensional jump Markov chains. This framework allows us to re-derive some past results for the in…

Probability distributions over CSS codes: two-universality, QKD hashing, collision bounds, security
Pete Rigas
https://arxiv.org/abs/2510.02402 https://arx…

Probability distributions over CSS codes: two-universality, QKD hashing, collision bounds, security
We characterize novel probability distributions for CSS codes. Such classes of error correcting codes, originally introduced by Calderbank, Shor, and Steane, are of great significance in advancing the fidelity of Quantum computation, with implications for future near term applications. Within the context of Quantum key distribution, such codes, as examined by Ostrev in arXiv: 2109.06709 along with two-universal hashing protocols, have greatly simplified Quantum phases of computation for uncondi…

Learning-Based Hashing for ANN Search: Foundations and Early Advances
Sean Moran
https://arxiv.org/abs/2510.04127 https://arxiv.org/pdf/2510.04127

Learning-Based Hashing for ANN Search: Foundations and Early Advances
Approximate Nearest Neighbour (ANN) search is a fundamental problem in information retrieval, underpinning large-scale applications in computer vision, natural language processing, and cross-modal search. Hashing-based methods provide an efficient solution by mapping high-dimensional data into compact binary codes that enable fast similarity computations in Hamming space. Over the past two decades, a substantial body of work has explored learning to hash, where projection and quantisation funct…

Locality-Sensitive Hashing-Based Efficient Point Transformer for Charged Particle Reconstruction
Shitij Govil, Jack P. Rodgers, Yuan-Tang Chou, Siqi Miao, Amit Saha, Advaith Anand, Kilian Lieret, Gage DeZoort, Mia Liu, Javier Duarte, Pan Li, Shih-Chieh Hsu
https://arxiv.org/abs/2510.07594

Locality-Sensitive Hashing-Based Efficient Point Transformer for Charged Particle Reconstruction
Charged particle track reconstruction is a foundational task in collider experiments and the main computational bottleneck in particle reconstruction. Graph neural networks (GNNs) have shown strong performance for this problem, but costly graph construction, irregular computations, and random memory access patterns substantially limit their throughput. The recently proposed Hashing-based Efficient Point Transformer (HEPT) offers a theoretically guaranteed near-linear complexity for large point …

Hash chaining degrades security at Facebook
Thomas Rivasseau
https://arxiv.org/abs/2510.12665 https://arxiv.org/pdf/2510.12665

Hash chaining degrades security at Facebook
Modern web and digital application password storage relies on password hashing for storage and security. Ad-hoc upgrade of password storage to keep up with hash algorithm norms may be used to save costs but can introduce unforeseen vulnerabilities. This is the case in the password storage scheme used by Meta Platforms which services several billion monthly users worldwide. In this paper we present the first example of an exploit which demonstrates the security weakness of Facebook's password st…

from my link log —
Modern perfect hashing with tricks from computer chess.
https://blog.sesse.net/blog/tech/2025-10-23-21-23_modern_perfect_hashing.html
saved 2025-10-24