Index
Archive & Dissertations

Research & Engineering Essays.

Rigorous empirical benchmarks, architectural teardowns, and analytical examinations of frontier AI models, autonomous agents, and inference systems.

Showing 4 of 4 Published Papers
Systems & Arch
September 12, 2026•8 min read

Architecting an Enterprise AI Control Plane: Circuit Breakers, Cost Autopilot, and AST Guardrails

A blueprint for building production-grade AI infrastructure. Moving beyond toy wrappers to engineer an extensible AI Control Plane featuring token-bucket rate limits, automated circuit-breaker failovers, semantic cost routing, AST-enforced SQL guardrails, and continuous log-mined evaluation datasets.

Core Thesis:"AI systems fail on a non-binary quality gradient, requiring multi-critic probabilistic arbitration and canary rollbacks."
Read complete paper
Artificial Intelligence
September 8, 2026•6 min read

On the Economics of Context: Latency, Cost, and Cache Invariance in Frontier LLMs

A systematic evaluation of KV-cache reuse on large prompt prefixes. Demonstrating how prompt structure and prefix invariance cut input token expenditure by up to 75% while reducing Time-To-First-Token from 1.4s down to 310ms.

Core Thesis:"Cache utilization yields maximum ROI on prompt prefixes exceeding 32,000 tokens evaluated more than four times within their TTL window."
Read complete paper
Autonomous Agents
August 26, 2026•7 min read

The Fallacy of Heavy Agent Frameworks: Returning to Deterministic State Machines

Why multi-layered autonomous agent abstractions frequently fail in high-stakes production systems, and how minimalist typed state loops deliver superior reliability, observability, and deterministic bounds.

Core Thesis:"Layered abstractions introduce opaque failure modes, hidden retry storms, and unmonitored token consumption."
Read complete paper
Performance
July 29, 2026•8 min read

High-Dimensional Vector Search: Memory Geometry of HNSW vs Quantized Inverted Indices

A deep examination of graph-based versus inverted-file vector indexing when scaling beyond 1,000,000 dense vectors. Architectural trade-offs between DRAM footprint, re-indexing pauses, and NDCG recall.

Core Thesis:"HNSW graphs require up to 1.5x additional RAM beyond raw vector data to store multi-layer bidirectional proximity graphs."
Read complete paper