January 19, 2026
Building Languages to Solve Problems
When a problem is complex enough, the right move is to build a language for that problem. SICP's most powerful idea.
Computer-Science
Browse posts by category
January 19, 2026
Duality: The Hidden Structure of Opposites
Many structures come in pairs: forward/reverse AD, push/pull iteration, encode/decode. Recognizing duality lets you transfer theorems and insights between domains.
January 18, 2026
Seeing Structure First
A reflection on eleven explorations in generic programming, and how algorithms arise from algebraic structure.
January 15, 2026
Entropy Maps: When Hashing Meets Information Theory
A conceptual introduction to entropy maps, implementing functions with hash functions and prefix-free codes.
November 30, 2025
Alga: Algebraic Text Processing with Fuzzy Matching
A C++20 header-only library for algebraic text processing and compositional parsing with fuzzy matching.
November 30, 2025
AlgoGraph: Immutable Graph Library with Functional Transformers
AlgoGraph is an immutable graph library for Python with pipe-based transformers, declarative selectors, and lazy views.
November 30, 2025
CBT: Computational Basis Transforms
A C++17 header-only library that formalizes a pattern behind FFT, logarithmic arithmetic, and Bayesian inference: transform to a domain where your target operation is cheap.
November 30, 2025
fuzzy-logic-search: Query Documents with Fuzzy Logic
A framework for querying structured JSON documents using fuzzy logic, producing degree-of-membership scores instead of binary relevance.
November 30, 2025
libdis: Disjoint Interval Sets as a Complete Boolean Algebra
A C++ header-only library that treats disjoint interval sets as proper mathematical objects with Boolean algebra operations.
November 30, 2025
XTK: A Symbolic Expression Toolkit for Term Rewriting
A Python library for rule-based term rewriting with pattern matching, multiple input formats, and an interactive REPL.
October 15, 2025
What I Learned by Analyzing My Own Research as Data
I asked an AI to analyze 140+ repos and 50+ papers as a dataset. The unifying thesis it found: compositional abstractions for computing under ignorance.
October 14, 2025
Bernoulli Types: A Foundation for Approximate and Oblivious Computing
A unified type-theoretic foundation for probabilistic data structures, approximate computing, and oblivious computation with information-theoretic privacy guarantees.
October 14, 2025
Cipher Maps: Category Theory Meets Oblivious Computing
Formalizing oblivious computing through cipher maps and algebraic cipher types, using category theory for functorial composition of privacy-preserving transformations.
October 14, 2025
Encrypted Search and Oblivious Types
Oblivious types give encrypted search information-theoretic privacy against access pattern leakage. No ORAM, no computational hardness assumptions. Here's how.
October 12, 2025
DagShell: A Content-Addressable Virtual Filesystem
A virtual POSIX-compliant filesystem using content-addressable DAG storage with SHA256 deduplication.
October 6, 2025
ZeroIPC: Shared Memory as a Computational Substrate
ZeroIPC treats shared memory not as passive storage but as an active computational substrate, bringing futures, lazy evaluation, reactive streams, and CSP channels to IPC with zero-copy performance.
July 15, 2025
chop: When Every Command Returns the Same Kind of Thing
27 image commands, one constraint: read JSON, write JSON. The closure property as a generative design principle.
January 15, 2025
Differentiation: Three Ways
Three approaches to computing derivatives, forward-mode AD, reverse-mode AD, and finite differences, each with different trade-offs for numerical computing and machine learning.
December 20, 2024
JAF: Streaming Boolean Algebra Over Nested JSON
A streaming data processing system implementing boolean algebra over nested JSON structures, with lazy evaluation, S-expression queries, and memory-efficient windowed operations.
December 18, 2024
jsonl-algebra: Relational Algebra for Nested JSON
A command-line implementation of relational algebra for JSONL data with full support for nested structures, schema inference, and composable pipelines.
December 15, 2024
The Dot Ecosystem: From Simple Paths to Data Algebras
A composable ecosystem of tools for manipulating nested data structures. From a simple helper function to a full data algebra, guided by purity, pedagogy, and the principle of least power.
November 20, 2024
JSL: A Functional Language Where Code Is JSON
A Lisp-like functional language designed for network transmission. JSL makes JSON serialization a first-class design principle, so closures, continuations, and entire computation states can travel over the wire.
June 21, 2024
AlgoTree: Immutable Trees with Functional Transformers
An immutable-by-default tree library for Python with composable transformations, pipe-based pipelines, and pattern-matching selectors.
June 10, 2024
maph: Maps Based on Perfect Hashing for Sub-Microsecond Key-Value Storage
A key-value store built on memory-mapped I/O, approximate perfect hashing, and lock-free atomics. Sub-100ns median latency, 10M ops/sec single-threaded.
June 10, 2024
PFC: Zero-Copy Data Compression Through Prefix-Free Codecs
A header-only C++20 library that achieves 3-10x compression with zero marshaling overhead using prefix-free codes and Stepanov-style generic programming.
March 1, 2024
Accumux: Compositional Online Statistical Reductions in C++
A C++20 library for composing online statistical accumulators with numerically stable algorithms and algebraic composition.
February 5, 2024
Runtime Polymorphism Without Inheritance
Sean Parent's type erasure gives you value-semantic polymorphism without inheritance. Combined with Stepanov's algebraic thinking, you can type-erase entire algebraic structures.
February 1, 2024
Perfect Hashing: Space Bounds, Entropy, and Cryptographic Security
Space bounds, entropy requirements, and cryptographic security properties of perfect hash functions.
August 28, 2023
Numerical Integration with Generic Concepts
Numerical integration meets generic programming. By requiring only ordered field operations, the quadrature routines work with dual numbers, giving you differentiation under the integral for free.
January 17, 2023
Reverse-Mode Automatic Differentiation
Reverse-mode automatic differentiation is just the chain rule applied systematically. I built one in C++20 to understand what PyTorch and JAX are actually doing.
November 1, 2022
Algebraic Hashing: Composable Hash Functions Through XOR
A C++ library for composable hash functions using algebraic structure over XOR, with template metaprogramming.
April 12, 2022
Numerical Differentiation
Choosing step size h for finite differences: small enough for a good approximation, not so small that floating-point errors eat your lunch.
March 31, 2022
Survey: Accelerating Critical Sections with Asymmetric Multi-Core Architectures
Suleman et al. (2009) propose using one big core to run critical sections on behalf of many small cores. The idea is simple. The tradeoffs are not.
October 30, 2021
Multiprocessor synchronization: tournament-Peterson lock
Generalizing Peterson's mutual exclusion algorithm to N processors using a tournament tree structure, with a Java implementation.
September 20, 2021
Forward-Mode Automatic Differentiation
Dual numbers extend the reals with an infinitesimal epsilon where epsilon^2 = 0. Evaluate f(x + epsilon) and you get f(x) + f'(x)*epsilon. The derivative falls out of the algebra.
March 8, 2021
Teaching Linear Algebra with C++20 Concepts
elementa is a linear algebra library built to teach. Every design decision prioritizes clarity over cleverness. Code that reads like a textbook and compiles.
July 14, 2020
Polynomials as Euclidean Domains
The same GCD algorithm works for integers and polynomials because both are Euclidean domains. One structure, many types, same algorithms.
February 18, 2020
Exact Rational Arithmetic
Rational numbers give exact arithmetic where floating-point fails. The implementation connects GCD, the Stern-Brocot tree, and the algebraic structure of fields.
September 10, 2019
Is It Prime?
The Miller-Rabin primality test demonstrates how probabilistic algorithms achieve arbitrary certainty, trading absolute truth for practical efficiency.
June 22, 2019
Modular Arithmetic as Rings
Integers modulo N form a ring, an algebraic structure that determines which algorithms apply. Understanding this structure unlocks algorithms from cryptography to competitive programming.
March 15, 2019
One Algorithm, Infinite Powers
The Russian peasant algorithm computes products, powers, Fibonacci numbers, and more, once you see the underlying algebraic structure.
October 15, 2018
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.