Summary
Overview
Work History
Education
Skills
Timeline
Generic
kajal

kajal

Research Engineer
Bengaluru

Summary

Innovative Research Engineer at Arithmic Labs, adept in Rust and Circom, engineered advanced cryptographic solutions enhancing zkVM rollups. Demonstrated strong research planning and collaboration skills, optimizing polynomial commitment schemes and implementing recursive proof systems, significantly improving proof efficiency and scalability in blockchain applications.

Overview

3
3
years of professional experience

Work History

Research Engineer

Arithmic Labs
12.2022 - Current
  • Engineered ECDSA signature verification within constraint systems, enabling compatibility with legacy blockchain systems in ZKP-compatible smart contracts.
  • Implemented cryptographic primitives such as Rescue and Poseidon hash functions within zero-knowledge proof circuits for efficient SNARK/STARK-friendly applications
  • Researched and prototyped the FRI (Fast Reed-Solomon IOPP) protocol to optimize polynomial commitment schemes in STARK-based proof systems.
  • Contributed to the implementation of Jolt-style verifiable computation using Circom for building efficient ZK circuits that validate general-purpose VM traces, enhancing zkVM-based rollups and on-chain verifiability
  • Implemented and optimized KZG (Kate-Zaverucha-Goldberg) polynomial commitment scheme, enabling succinct, constant-size proofs with fast verifier performance for rollup and zkEVM systems
  • Researched and prototyped the Binius arithmetization approach, leveraging binary fields to achieve high-performance constraint systems with improved prover speed and smaller proof sizes
  • Implemented recursive STARK proof verification using Nova, embedding a STARK verifier as a circuit within a recursive SNARK framework to enable scalable proof composition and succinct rollup proofs
  • Implemented an R1CS constraint system for a STARK verifier, enabling recursive proof composition by expressing the verifier logic as Rank-1 constraint systems within SNARK-compatible frameworks
  • Integrated Nova-based recursive proving system into the compiler toolchain, allowing automatic generation of recursive verifiers from high-level execution traces, bridging low-level STARK proofs with SNARK-friendly recursion layers
  • Optimized the verifier circuit for recursion, reducing constraint footprint while maintaining cryptographic soundness, enabling practical recursive proving at scale.
  • Bridged STARK and SNARK proof systems by translating verifier behavior into constraint systems, enabling recursive proving through Nova and integration into zk-compatible compiler backends
  • Implemented Merkle Tree and Merkle Patricia Trie (MPT) structures within a compiler toolchain, enabling verifiable state commitments and authenticated data access for blockchain-compatible ZK circuits
  • Integrated verifiable storage logic into compiler-generated circuits, allowing on-chain proof systems to validate key-value storage reads/writes against cryptographic commitments
  • Supported quantitative work with data sets.

Education

Master of Science - Mathematics

National Institute of Technology
Nagpur
04.2001 -

Skills

Rust

Circom

Latex

Mathematica

Excel

Research planning

Report building

Team collaboration

Technical documentation

Timeline

Research Engineer

Arithmic Labs
12.2022 - Current

Master of Science - Mathematics

National Institute of Technology
04.2001 -
kajal Research Engineer