$ kartik_chauhan STAFF ARCHITECT
Core Profile
๐Ÿ  Home ๐Ÿš€ Projects Showcase ๐Ÿ“ Engineering Blogs ๐Ÿ“„ Curriculum Vitae (CV)
2026 Interview Prep Hub
๐ŸŽฏ 13-Week Roadmap ๐Ÿ“š Topics & Deep Notes ๐Ÿƒ 3D Flashcards
Knowledge Ecosystem
๐Ÿ“– Bookshelf & Mental Models ๐Ÿ’ญ Engineering Thoughts (Tweets) ๐Ÿ” Search 800+ Docs
๐Ÿ“š CANONICAL KNOWLEDGE ECOSYSTEM

Bookshelf, Reading Tracker & Core Mental Models

Foundational computer science, distributed systems, and low-level engineering literature distilled into actionable architectural mental models. Every canonical book is directly linked to chapter notes in this repository and interactive 3D flashcards.

12
Canonical Books
6
Read & Synthesized
3
Currently Reading
3
Staff Recommended
48+
Mental Models Linked
โณ Loading curated bookshelf and reading notes...
๐Ÿง  FIRST-PRINCIPLES CHEATSHEET

Key Mental Models Derived from Canonical Literature

Architectural invariants and trade-offs that distinguish senior from staff-level systems design.

๐Ÿƒ Drill All Mental Models on Flashcards
Storage Engines (DDIA & Petrov)

LSM-Tree vs B-Tree Duality

LSM-trees turn random writes into sequential disk writes at the cost of compaction overhead and read-amplification. B-trees optimize point reads with deterministic tree depths at the cost of random write I/O.

๐Ÿƒ Practice Flashcard
Operating Systems (OSTEP)

Futexes & Fast User-Space Locking

Uncontended locks should execute via hardware CAS without a syscall. Kernel context switching into sleep queues only occurs when contention is detected, saving thousands of CPU cycles.

๐Ÿƒ Practice Flashcard
Concurrency (JCIP & Effective Java)

Happens-Before & Memory Visibility

Synchronization isn't just about atomic mutual exclusion. Without happens-before edges (volatile writes or lock releases), CPU registers and out-of-order execution leave state changes invisible to other cores.

๐Ÿƒ Practice Flashcard
Distributed Systems (Vitillo & DDIA)

Fencing Tokens & Lease Invalidation

Distributed locks with TTLs (e.g. Redlock) are unsafe against GC pauses unless target storage enforces strictly monotonic fencing tokens on every mutation (`version > prev_version`).

๐Ÿƒ Practice Flashcard