Where does a 50% single-core gain from M2 to M5 actually come from? Lemire breaks it down: the P-core clock rose 30% (3.5 to 4.6 GHz), which covers most of it, decode width grew from 8 to 10 instructions per cycle, and memory bandwidth went from 100 to 154 GB/s. SIMD barely moved, still four 128-bit units.

How do you make clouds look right without faking it? The OP suspected povray skipped multiple scattering, so they wrote a few hundred lines of Rust Monte Carlo ray tracer to check. It did. The best trick is tiny: tilt the cloud normals up toward the sky and they pick up its blue, then turn pink at sunset for free.

What does it take to serve Kimi K2.6 to coding agents cheaply and fast? Modal walks through it for regular engineers: tensor parallelism beat every other strategy for interactivity, speculative decoding gave gains in whole multiples, NVFP4 and an FP8 KV cache were checked with evals, and a tiered KV cache stopped hit rates from collapsing. The result was 2.8x per user.

What if your SSH key couldn’t be stolen at all? On a Mac it takes three commands: sc_auth creates a non-extractable key inside the Secure Enclave, ssh-add loads it through Apple’s built-in ssh-keychain.dylib, and every git push asks for Touch ID. No key files on disk. The second half digs into the mostly undocumented plumbing that makes it work.

How do you cut 3.7 million map polygons into triangles faster than earcut? The OP swapped a 2.93s Delaunay triangulator for ear clipping, then rebuilt it one idea per commit, timing each one: test only the dents, use zig-zag strips, bucket the vertices, remove branches. They got to 489 ms, with interactive figures along the way. The result is earstrip, a one-header C++ library.

Can a tiny model fake a whole terminal? There’s no shell behind it: each keypress goes in and the model predicts which screen rows change, with a COPY op so scrolling stays cheap. The OP fine-tuned Qwen2.5-Coder on Docker sessions and taught it to repair its own mistakes. It runs vim, tmux and snake in your browser over WebGPU. Type pythoon to catch it out.

What does a game camera actually do? Mostly divide by z. The OP starts with that one trick, uses it to draw a ball orbiting in live shaders, then builds the full perspective projection matrix and shows that x/z falls out of it once focal scale and aspect ratio are set to 1. Then the whole world-to-pixels pipeline finally has names.

How does gzip shrink a file and get every bit back? The OP explains DEFLATE’s two tricks, back-references to repeated bytes and Huffman coding, with a playground where you type text and watch the bit codes change. Then they build ABC, a 580-line dependency-free Rust compressor using Huffman alone. It takes a 622 KB book down to 366 KB, against gzip’s 234 KB.

What’s the difference between a warp, a CTA and an SM, and how does nvcc turn into SASS? NVIDIA’s docs are scattered across PDFs and Discords, so Modal pulled the whole stack into one linked glossary: device hardware, the CUDA programming model, host software like libcuda and nvidia-smi, and performance terms like roofline, occupancy and bank conflicts.

How do you make six heading levels look different without leaning on colour, italics or all caps, which fail colour-blind and dyslexic readers? The OP derives everything from one modular-scale ratio off the body size. Font size goes first until it bottoms out at body size, then the spacing above and below each heading, then font weight, all in CSS you can copy.

What does an elliptic curve look like once you’re working mod p? A scatter of points, not a smooth line, yet “connect and flip” point addition still works and the points form a cyclic group. RareSkills builds it up in Python on y² = x³ + 3 mod 11, plotting each step, then ties it back to BN128, the curve Ethereum uses to verify ZK proofs.