I study and build systems for storing, coordinating, and verifying data. My work explores distributed systems, storage engines, and authenticated data structures for blockchain workloads.
We introduce the Huffman-Merkle Tree (HMT), an authenticated data structure that adapts to changing access patterns. It combines Huffman-based layouts with hot/cold tiering, frequency estimation, and batched updates. We evaluate hashing overhead and access-weighted membership proofs against Ethereum's Merkle Patricia Trie and the proposed Unified Binary Tree on real-world Ethereum workloads.
Built a lightweight Ethereum block-execution simulator by separating storage components from Geth. The simulator replays blocks and collects static traces without a full client setup, with a modular framework and documentation for storage experiments.
02
Selected projects
Building systems from the storage layer up.
Storage engine
MiniDB
A Bitcask-based key-value store supporting Redis data structures and pluggable B+ tree / B-tree indexes.
Write-ahead logging and sequential disk I/O
In-memory indexes for efficient lookups
Key-value storage
WAL
Indexing
Distributed systems
Raft-KV Storage
A sharded, fault-tolerant key-value store built around multiple Raft consensus groups.
Leader election, log replication, and a pre-vote phase
Snapshot installation and persistent-storage garbage collection
Raft
Replication
Sharding
03
A little more about me
Education
Current
Brown University
Master's in Computer Science
Sep 2022 – Dec 2025
University of California, Santa Barbara
B.S. in Computer Science
Tools I work with
Go
C++
Python
Rust
Git
Linux
Teaching
Undergraduate Learning Assistant University of California, Santa Barbara
CS 40 · Discrete Math
Fall 2025
Formal proofs and discrete mathematics.
CS 64 · Assembly Language
Spring 2025
C/C++ to assembly, machine logic, and digital logic.
CS 16 · Introduction to C++
Fall 2024
Programming fundamentals, debugging, and memory concepts.