Contributor to CrocSwap/integer-mult-bounds, the open research race on the exponent of integer multiplication, T(n) = O(n (log n)^(1−κ)), that follows OpenAI's "Integer multiplication below n log n" (open problem #109).
- PR #520 (merged into main, Oct 2026): an open owner-allocation solver for the asynchronous whole-owner hosting used by the leading constructions, plus an exact map of where the complex word's 560 helpers go.
- Earlier work in the same race: cross-copy hosting (#448, #480, #494, under review), decoder rigidity checks, and a set of exact negative results on delivery sharing and bit-side entrances.