Zero-knowledge engineer building proving systems in Rust.

An educational STARK proving system implemented from scratch — finite-field arithmetic, FFT/IFFT, low-degree extension, Merkle commitments, Fiat–Shamir transcripts, and FRI folding. Working with execution traces, AIR constraints, and composition polynomials.

Polynomial commitments, evaluation proofs, quotient polynomial construction, and pairing-based verification — using structured reference strings and bilinear pairings over BLS12-381.

An EVM transaction analysis toolkit — ABI calldata decoding, transaction simulation, bytecode disassembly, an 844-instruction EVM parser, and detection of Uniswap swaps, sandwich attacks, and arbitrage activity.

An on-chain staking contract — SPL token deposits, PDA-based access control, reward calculation, lock-up periods, early withdrawal penalties, and cross-program invocations.

A persistent key-value store built in Rust. Log-structured storage engine — every write is an append, reads resolve via an in-memory index, stale entries are garbage-collected through compaction.

A multi-threaded reverse proxy on Tokio and Hyper — per-IP token bucket rate limiting and HTTPS tunneling via the CONNECT method.