Skip to main content

Algorithms

2026

Searching Without Being Searched: The Architecture of Oblivious Prefix Trees
·5970 words·29 mins
Computer-Science Algorithms Algorithms Data-Structures Tries String-Search Security Privacy Oram
A rigorous analysis of Prefix Trees (Tries) and Radix Trees, evolving from memory hierarchy constraints to cryptographically secure Data-Oblivious architectures.
The Mathematics of Dense Vector Search
·11366 words·54 mins
Math-Science Datasci Vector-Search Algorithms Math Databases Data-Science
A comprehensive deep dive into the mathematical foundations and algorithms of modern vector search, including HNSW, DiskANN, Quantization, and the Curse of Dimensionality.