Generalist happiest with problems bigger than my grasp. Low-level tinkerer, slow walker/thinker. UMD CS. AI, DBs, PLs. Making things faster, better, simpler.
@arpit_bhayani >but as a tangent bridging #18 and #12: if you don't need strict AOF crash semantics, persistence works right at the allocator level. I built a single-header file-backed C malloc for zero-cost ser/deserialization: https://t.co/uKWexPV8gL
You can write a surprisingly large class of software under 1.44Mb (a floppy): editors, databases, games, even operating systems. Beyond that, it is usually more abstraction paying for excess.
Natural language is little-endian: lower-significance bits come first as shared context, and higher-significance bits come later as the informative payload.
This 1-pager from Xusheng Li on GDB internals of how watchpoints are implemented is a delight to read! (especially that double-write behaviour false positive - I did not know about that)
https://t.co/MDgy5rQNIe is a C allocator with explicit heap regions. It can work as a drop-in allocator, or give each subsystem its own heap, cap it, inspect it, and destroy it in one step.
Fabs have massive fixed costs but near-zero marginal costs and strong long-term pricing power. AI software is hyper-competitive, supply-constrained today but structurally deflationary. Capital may compound better at the chip layer than in crowded model apps.
Spotting selective evidence in papers (CS):
The performance graph shows the new algorithm/data-structure and the baseline tangled together rather than clearly separated.
Results on standard tasks/tests are relegated to the appendix due to page limits. While the main body seems focused on finding a problem for a specific tool rather than solving a fundamental issue.