About
I completed my PhD in computer science at Yale University, advised by Ben Fisch. Previously, I worked with Alessandro Chiesa at UC Berkeley and with Mary Maller at UCL. My research focuses on efficient constructions of cryptographic proof systems, including hash-based and lattice-based succinct arguments. I am a co-author of Marlin and ripp in the arkworks ecosystem.
Before graduate school, I was a security engineer at the Freedom of the Press Foundation, where I was a core developer of SecureDrop. I am currently looking for an industry research position.
Preprints & Submissions
Zinc+: SNARKs for Polynomial Rings in review
Submitted to CRYPTO 2026 · Accepted at zkSummit14
A framework for building SNARKs over multiple rings simultaneously, including finite fields, the integers, the rationals, and polynomial rings. We introduce Universal Constraint Systems (UCS), a new arithmetization that captures bitstring operations, multi-field arithmetic, and ring-level operations with significantly reduced overhead compared to single-field approaches. Compiled with Zip+, a hash-based multilinear polynomial commitment scheme built on a new family of error-correcting codes (Integer Pseudo-Reed Solomon codes) supporting coefficients over all of these domains.
Publications
Orbweaver: Succinct Linear Functional Commitments from Lattices
CRYPTO 2023
The first post-quantum functional/polynomial commitment to achieve quasilinear prover time together with O(log n) proof size and a sub-O(log2 n) verifier. Enables evaluation of linear functions and polynomials on committed vectors over cyclotomic rings and the integers. Extractable, preprocessing, non-interactive, structure-preserving, and supports logarithmic public proof aggregation.
Plumo: An Ultralight Blockchain Client
Financial Cryptography 2022
A consensus-agnostic methodology for constructing ultralight clients via SNARK-based state transition proofs. Introduces a BLS-based offline aggregate multisignature scheme (where signers need not know their group in advance) and a composite algebraic-symmetric cryptographic hash function.
Proofs for Inner Pairing Products and Applications
ASIACRYPT 2021
A generalized inner product argument for any bilinear map, applied to pairing-based languages. Yields the first polynomial commitment with succinct (logarithmic) verification and O(√d) prover complexity, the first concretely efficient protocol for aggregating Groth16 proofs without recursion, and a low-memory SNARK with significantly faster proving.
Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS
EUROCRYPT 2020
A methodology for constructing preprocessing zkSNARKs where the structured reference string is universal and updatable, via a novel use of holographic IOPs. Achieves an order-of-magnitude improvement in proving time and 3× faster verification over the prior state of the art, with smaller SRS and argument size.
Experience
Advised by Ben Fisch. Dissertation: Efficient Hash- and Lattice-Based Proof Systems for Mixed Algebras. Supported by an Ethereum Foundation research grant.
Provided scientific guidance on snarkVM and developed extensions to the Marlin proof system for batch proving and aggregation.
Designed Plumo, the ultralight client for the Celo blockchain, using SNARKs and circuit-friendly primitives.
Worked with Alessandro Chiesa on zero-knowledge proof systems.
Graduated with distinction (highest classification). Thesis on polynomial commitment schemes with Mary Maller.
Core developer of SecureDrop, the open-source whistleblower submission platform.
Software
marlin co-author
Implementation of the Marlin preprocessing zkSNARK.
ripp co-author
Inner pairing product arguments and applications.
sodiumoxide maintainer
Rust bindings for the libsodium cryptography library.
securedrop core contributor
Open-source whistleblower submission platform.