Research Index
Formal engineering investigations, hypotheses, empirical measurements, and published findings. Each entry is reproducible and linked directly to working code.
Memory-Bounded LRU Caches for Vector Embedding Pipelines
Investigating deterministic cache eviction policies for multi-dimensional float32 embeddings in resource-constrained container environments.
Bounded Graph Traversal & Adjacency Mapping for Engineering Knowledge
A study on representing multi-entity software engineering dependencies using memory-bounded adjacency maps and cycle-detected BFS traversals, avoiding graph database overhead while delivering sub-5ms multi-hop link discovery.
Deterministic State Machines & Token Inverted Index for Agentic Retrieval
An investigation into eliminating non-deterministic hallucinations in LLM retrieval by pairing a deterministic finite state machine with a memory-bounded token inverted index, demonstrating sub-millisecond keyword localization and zero invalid state transitions.