Lab.
Interactive technical essays where you can experiment with the concepts while reading. Not a blog. More like a playground that happens to have words.
Sections
ECS
Archetypes, sparse sets, cache-friendly iteration
Algorithms
Search, sort, pathfinding, compression
Performance
CPU caches, memory layouts, branch prediction
Roblox
Gameplay systems, networking, optimization
Reverse Engineering
Memory, binaries, debugging
Linux
Tools, workflows, systems programming
Trading
Systems, automation, market structure
Notes
Short technical thoughts
Recent
Search Algorithms and Why Your CPU Hates Binary Search
A deep look at linear and binary search from the perspective of your CPU's cache hierarchy. What really happens when you access memory, and why O(log n) isn't always faster.
Rust Ownership Mental Model
A practical cheatsheet for when to use references, clones, Rc, Arc, and Box. No fluff, just the decision tree.
Cache Lines, Memory Layout, and Why Your Struct Order Matters
How CPU caches actually work, why padding exists, and how to lay out your data structures for maximum throughput.
Sparse Set Internals and Why ECS Frameworks Love Them
How sparse sets achieve O(1) add, remove, and lookup while keeping iteration cache-friendly. The data structure that powers most ECS query systems.
Branch Prediction and Why Sorted Data Runs Faster
How your CPU guesses which way an if-statement will go, what happens when it's wrong, and why processing sorted arrays can be dramatically faster than unsorted ones.
Archetype Storage: How Bevy and Flecs Organize Entity Data
A deep look at archetype tables, component moves, and why changing an entity's component set is the most expensive operation in an archetype ECS.