We build reproducible research artifacts, exact-computation pipelines, and human-first interfaces for hard technical problems.
Current focus: AI-assisted mathematical discovery where the claims are checked by exact arithmetic, formal methods, or runnable verifiers, not vibes. Recent work: an exact pinned-triple theorem around the MUB(6) problem, packaged with a verification bundle.
Interested in quantum information, formal verification, FPGAs, reproducible compute, mathematical games, and tools that make hard ideas easier to inspect.
If you can run, break, route, or improve something I post, I want to hear from you.