Information-Theory

Oblivious Computing: Privacy Through Approximation

Entropy Maps: When Hashing Meets Information Theory

A conceptual introduction to entropy maps—implementing functions with hash functions and prefix-free codes.

Information Theory, Inference, and Learning Algorithms

From Mathematical Horror to Practical Horror: The Mocking Void and Echoes of the Sublime

How The Mocking Void's arguments about computational impossibility connect to Echoes of the Sublime's practical horror of exceeding cognitive bandwidth.

Compositional Abstractions for Computing Under Ignorance: Or, What I Learned by Analyzing My Own Research as Data

A meta-analysis of my own research as data, tracing how compositional abstractions for computing under ignorance connect oblivious computing, information theory, and existential risk.

Bernoulli Types: A New Foundation for Approximate and Oblivious Computing

Introducing Bernoulli types as a unified type-theoretic foundation for probabilistic data structures, approximate computing, and oblivious computation with information-theoretic privacy guarantees.

Maximizing Confidentiality in Encrypted Search Through Entropy Optimization

Rethinking Encrypted Search: From Access Pattern Leakage to Information-Theoretic Privacy

Rethinking encrypted search through oblivious types that provide information-theoretic privacy guarantees against access pattern leakage, without relying on computational hardness assumptions.

All Induction Is the Same Induction

Solomonoff induction, MDL, speed priors, and neural networks are all special cases of one Bayesian framework with four knobs.

The Beautiful Deception: How 256 Bits Pretend to be Infinity

How do you store infinity in 256 bits? An exploration of the fundamental deception at the heart of cryptography: using finite information to simulate infinite randomness.

Entropy Maps

Entropy maps use prefix-free hash codes to map domain values to codomain values without storing the domain, enabling lossy compression with information-theoretic bounds.

Perfect Hashing: Space Bounds, Entropy, and Cryptographic Security

Analyzing the space bounds, entropy requirements, and cryptographic security properties of perfect hash functions.

Packed Containers: Zero-Waste Bit-Level Storage in C++

What if containers wasted zero bits? A C++ library for packing arbitrary value types at the bit level using pluggable codecs.

Introduction to Sequential Prediction

The fundamental problem of predicting what comes next—from compression to language models