Julius Zhang

Ph.D. student, Computer Science
Courant Institute of Mathematical Sciences, New York University

I am a first year Ph.D. student working at the intersection of systems, security, and verifiable computation. I am particularly interested in succinct proofs for real-world computations. More broadly, I like problems in systems where computation meets mathematics, across areas such as distributed protocols, convex optimization, and high-performance computing.

I am visiting the Department of Mathematics at Columbia University, where I am hosted by Andrew Blumberg.

I earned my B.A. in Mathematics and M.S. in Computer Science from Stanford University, where I did research in algebraic geometry and geometric topology, and worked on distributed systems.

I write a technical blog on mathematics and computer science as I figure things out.

Outside of research, I like to do judo and sketch in art galleries – a habit from my teenage years in London, when I volunteered at the National Portrait Gallery by Trafalgar Square. I am yondan in Go.

Portrait of Julius Zhang

60 Fifth Avenue
New York, NY 10011

julius.z (at) nyu (dot) edu

Publications and Manuscripts

  1. The relative trace-zero subgroup of the Barreto-Naehrig curves
    Julius Zhang
    Cryptology ePrint Archive, 2026.
  2. Spain: Succinct proofs for numerical computations
    Zachary DeStefano, Noah Golub, Zile Huang, Julius Zhang, Sam Frank, and Michael Walfish
    20th USENIX Symposium on Operating Systems Design and Implementation (OSDI 2026), Seattle, WA, July 2026.
  3. Complex cobordism and formal group law
    Julius Zhang
    Undergraduate honours thesis advised by Mohammed Abouzaid, Stanford University, 2024.

Talks

Notes

Teaching