01

arXiv:2608.02675 · math.CO · August 2026

A 60-Vertex Lower Bound for Cubic Bipartite Counterexamples to the Erdős-Gyárfás Conjecture

A reproducible computer-assisted result proving that every simple cubic bipartite graph on at most 58 vertices contains a cycle of length 4, 8, or 16. Consequently, any cubic-bipartite counterexample to the Erdős-Gyárfás conjecture has at least 60 vertices. The reproducibility artifact was published on GitHub on July 29, 2026.

02

arXiv:2512.06203 · December 2025 · with Naman Gupta

Formal State-Machine Models for Uniswap v3 Concentrated-Liquidity AMMs

Formal state-machine models for concentrated-liquidity automated market makers and their core transitions.

Protocol infrastructure

cardano-ibc-incubator

Trust-minimized IBC interoperability between Cardano and Cosmos, built in Rust.

Lead engineer · Rust, Cardano, Cosmos, IBC

Trading infrastructure

polyfill-rs

An open-source Polymarket client for Rust with more than 200 GitHub stars.

Builder and maintainer · Rust, APIs, trading systems

Education

McGill University

Bachelors, Computer Science

Talk / 2026

Builderfest · Buenos AiresTrust-minimized IBC interoperabilityWatch talk