
Involutions: The License to Update in O(1)
Why Zobrist hashing updates a chessboard in constant time, and the property that makes incremental computation possible.
Short stories on software design and performance.
Live Last read · last published · next check

Why Zobrist hashing updates a chessboard in constant time, and the property that makes incremental computation possible.

Why ignoring most of your neural network is the key to efficiency

Why logarithms prevent underflow, why Fourier speeds up convolutions, and how choosing the right space makes hard problems tractable

How to discover solutions, not just memorize them.

And the property that makes neural network training computationally tractable

And other consequences of order not mattering

What computing an average teaches us about the most important optimization in modern ML

Or a case of missed optimizations

Or why it's useful to know the size.

Or taking advantage of better algorithms.