Browse posts by category
Check out the (early) project and source code on GitHub.
This paper introduces a methodology for generating high-quality, diverse training data for Language Models (LMs) in complex problem-solving domains. Our approach, termed …
What if we could compute on encrypted data while preserving algebraic structure? Not through expensive homomorphic encryption, but through a principled mathematical framework that unifies oblivious computing, Bernoulli types, and categorical …
What if a perfect hash function could simultaneously be: (1) cryptographically secure, (2) space-optimal, and (3) maximum-entropy encoded? This paper proves such a construction exists—and analyzes exactly what you sacrifice to get all three.
Sometimes making stronger assumptions doesn’t limit you—it illuminates the problem. This paper, developed before my master’s thesis, shows what happens when you simplify both the distribution (exponential) and the masking model: you get …