Thoughts on motion, code, design systems, and the business of building things on the web.
I benchmarked Dijkstra and A* on the entire road network of Lucknow — 302,066 nodes, 4,132 km². Here's what the data actually showed, and why the Gomti River makes uninformed search almost useless.
Over 600 million Indians drink water contaminated with arsenic, fluoride, or lead — and no affordable field sensor detects all three simultaneously. We tried to change that with graphene oxide, DNA aptamers, and a Random Forest classifier.
Lyles ran 9.79s. Jacobs ran 9.80s. Raw times say Lyles is faster. Physics says otherwise. Here is the complete environmental correction that reveals the Jacobs-Lyles Paradox.
RSA is unbreakable in theory. In CTFs, it breaks constantly — because implementations cut corners. Here are the attacks I use most, why they work mathematically, and how to spot them from the challenge prompt.
BFS, Dijkstra, Bellman-Ford, Floyd-Warshall, A*. Every graph algorithm wins in specific domains and silently fails in others. Here is the decision framework I use in contests.
What happens when you try to build a mental health app for teenagers? We submitted MindShift to the MIT Global Appathon. Here is what we built, what we got wrong, and what the design decisions actually cost us.
