Barycentric Simplicial Hashing for Approximate Nearest Neighbor Search: A Four-State Topological Hash Competitive with Industry-Standard Product Quantization at Half the Memory
Skip to main
You are using an outdated browser. Please upgrade your browser to improve your experience.
New blog post on the May 13–15 incident. We sincerely apologize for the incident, the disruption it caused, and any concern it raised.
Published May 26, 2026
| Version 1
Preprint
Open
Barycentric Simplicial Hashing for Approximate Nearest Neighbor Search: A Four-State Topological Hash Competitive with Industry-Standard Product Quantization at Half the Memory
Authors/Creators
Pirolo, Andrés Sebastián
Description
We present Barycentric Simplicial Hashing (BSH), a data-dependent binary indexing method for approximate nearest neighbor (ANN) search that uses the local triangulation of a vector space as a discrete coordinate system. Given a set of database vectors partitioned into Voronoi cells, we construct a k-NN simplicial complex within each cell and assign each vector a compact binary code by evaluating its barycentric zone relative to every triangle in the complex.
The key contribution is a four-state quantization per triangle: a vector is assigned to the zone of the nearest vertex (states 0, 1, 2) or to the barycentre zone (state 3) when the triangle centroid is the closest reference point. Empirical measurement confirms that the barycentre state is activated for over 51% of all triangle-vector assignments in 24-dimensional subspaces, making it the primary discriminator rather than a rare case.
On out-of-sample queries drawn from an independent distribution (separate random seed, never seen during index construction), the four-state hash achieves 84-90% Recall@1 in the top-10% of candidates within a Voronoi cell, using only 34-38 bytes per vector. Industry-standard FAISS IVF-PQ achieves comparable recall (85-90%) at 64 bytes per vector. BSH delivers competitive recall at approximately half the memory footprint. All methods are hardware-agnostic and were empirically validated on ARM Cortex-X3 using NEON intrinsics.
Files
pirolo2026_simplicial_hashing_v1.pdf
Files<br>(304.8 kB)
Name<br>Size
Download all
pirolo2026_barycentric_simplicial_hashing_v1-3.zip
md5:96742944ec8c96b5b927a1f503cbfb26
151.9 kB
Preview
Download
pirolo2026_simplicial_hashing_v1.pdf
md5:7e7ef9d4590fce33c83a4981d74cb463
152.9 kB
Preview
Download
Additional details
Software
Repository URL
https://zenodo.org/records/20389817
Programming language
C++
Development Status
Active
Views
Downloads
Show more details
All versions<br>This version
Views
Total views
Downloads
Total downloads
Data volume
Total data volume
0 Bytes<br>0 Bytes
More info on how stats are collected....
Versions
External resources
Indexed in
OpenAIRE
Communities
Keywords and subjects
Keywords
triangulation
Voronoi partitioning
approximate nearest neighbor
barycentric coordinates
Simplicial complex
Fais
Dimensionality course
Gnn
Llm
Hashing
memory-efficient indexing
LLM embeddings
ANN index
vector database
MeSH
Abstracting and Indexing/classification
Details
DOI
DOI Badge
DOI
10.5281/zenodo.20389817
Markdown
[](https://doi.org/10.5281/zenodo.20389817)
reStructuredText
.. image:: https://zenodo.org/badge/DOI/10.5281/zenodo.20389817.svg<br>:target: https://doi.org/10.5281/zenodo.20389817
HTML
Image URL
https://zenodo.org/badge/DOI/10.5281/zenodo.20389817.svg
Target URL
https://doi.org/10.5281/zenodo.20389817
Resource type<br>Preprint
Publisher<br>Zenodo
Rights
License
Creative Commons Attribution Non Commercial No Derivatives 4.0 International
No further description.
Read more
Copyright
Copyright (C) 2026 Andrés Sebastián Pirolo
Citation
Export
Technical metadata
Created
May 26, 2026
Modified
May 26, 2026
Jump up
This site uses cookies. Find out more on how we use cookies
Accept all cookies<br>Accept only essential cookies