Adarsh Kumar

B.Tech ECE · IIT Patna · Patna, India

I build systems where correctness is the hard part — agentic payments with on-chain spend limits, routed mixtures of experts, and option pricing models that have to agree with each other.

Selected work

Things I've built

LedgerLighthouse

NTU InnovateX 2026

An agentic payment system that lets an LLM agent pay for API access over the x402 protocol against an on-chain spending budget it can never read, alter, or override.

  • Deployed the encrypted on-chain budget (Inco Lightning) live on Base Sepolia behind a 327-test CI suite, capping a compromised agent's worst-case loss by policy.
  • Specified TEE-derived signing keys (Oasis ROFL) as the custody model — designed, not yet deployed.
  • Enforced a CI-checked import boundary blocking the untrusted orchestrator from reaching the signer or the vendor's API credential.
  • Committed each spend's debit before the approval decision was knowable, closing the obvious race.
TypeScriptSolidityx402

Mini Sparse Mixture of Experts

A top-1 routed mixture-of-experts language system built from a 135M-parameter base, with three domain experts and a learned router.

  • LoRA fine-tuned three domain experts against frozen attention weights — about 1M trainable parameters per adapter, 0.74% of the base.
  • Trained a router MLP over 384-dimensional sentence embeddings on ~7,000 generated queries to dispatch each query to a single expert.
  • Evaluated with router accuracy, a confusion matrix, and per-expert perplexity rather than a single aggregate score.
PyTorchLoRATransformers

A C++ library pricing European and American options under four models, with a validation suite that makes the models check each other.

  • Implemented Black-Scholes (closed-form), Binomial Tree (backward induction), Monte Carlo (100K-path simulation), and Heston (stochastic volatility).
  • Wrote a validation suite checking put-call parity, American ≥ European price under early exercise, and intrinsic-vs-time-value decomposition.
C++Quantitative Finance

A competitive AI for the game Chain Reaction, tuned to search as deep as it can inside a hard move budget.

  • Minimax with alpha-beta pruning, iterative deepening, and a transposition table.
  • Tuned to reach maximum depth inside a 0.9-second per-move budget.
PythonGame-Tree Search
Research areas

What I want to work on next

Four threads I keep pulling on. Each one started as a project and left a question behind.

  1. 01

    Efficient & modular language models

    Sparse routing and parameter-efficient adaptation — what a router actually learns when experts are cheap to produce, and how routing should be supervised when the boundaries between domains are fuzzy rather than clean.

    Mini Sparse Mixture of Experts

  2. 02

    Agent safety through enforced constraints

    Autonomous agents held inside limits they cannot read, edit, or reason their way around. Encrypted on-chain budgets, capability boundaries checked in CI rather than trusted, and custody models that stay sound when the orchestrator is compromised.

    LedgerLighthouse

  3. 03

    Computational finance

    Stochastic volatility, variance reduction in Monte Carlo, and cross-model agreement used as a correctness tool — four independent pricers that must line up exactly where theory says they must.

    Option Pricing Model Library

  4. 04

    Search under a hard budget

    Anytime algorithms and game-tree search: producing the best answer available when the clock, not the algorithm, decides when the search stops.

    Chain Reaction AI Agent

Toolkit

What I work with

Languages
C++CPythonTypeScript
Machine Learning
PyTorchHugging Face transformers / PEFTLoRA fine-tuningSentence embeddingsReverse-mode autodiff from scratch
Quantitative
Probability & statisticsNumerical methodsBlack-ScholesBinomial treesMonte CarloHestonHigh-performance computation
Tools & Frameworks
GitNext.js / ReactPostgreSQLPrismaRedisSolidity / EVM
Coursework

Calculus and Linear Algebra (MA1101) · Probability Theory and ODEs (MA1201) · Data Structures (CS1201) · Signals and Systems (EC2102)

Background

Competition & education

2026

NTU InnovateX Hackathon 2026

Selected as 1 of 14 teams for the onsite finals at Nanyang Technological University, Singapore.

1620

Codeforces Expert

Rating 1620 — handle public_server.

IOQM

Indian Olympiad Qualifier in Mathematics

Qualified in both 2023 and 2024.

QualificationScoreYear
B.Tech, Electronics & CommunicationIndian Institute of Technology PatnaCPI 8.33 / 102029
Class XII — CBSEIndian Heritage School, Deoghar91.8%2025
Class X — ICSEMount Assisi School, Godda97.4%2023
Contact

Get in touch

I'm most interested in problems where a system has to stay correct under pressure. If that's what you're working on, I'd like to hear about it.