The fastest operation is the one your algorithm avoids
Remove repeated work with better structures, indexes, sorting strategies, batching, and precomputation.
Independent field notes / Vol. 01
Precise explanations of the machinery, patterns, and tradeoffs that make Python feel deceptively simple.
Read the cover storyThe index
49 notes, edited for signal.
Remove repeated work with better structures, indexes, sorting strategies, batching, and precomputation.
Measure temporary objects, retained memory, and data layout before trading clarity for reuse.
Design coroutine cleanup, deadlines, and cancellation propagation as observable interface behavior.
Follow one dotted expression through instance state, class namespaces, descriptors, method binding, and fallback hooks.
Design repeatable timing experiments that measure the workload you actually care about.
Use the call protocol to combine behavior with explicit state without pretending every callable is a function.
Diagnose circular imports as order-sensitive access to incomplete module namespaces, then repair the dependency graph instead of shuffling lines.
Understand late binding, shared nonlocal state, loop callbacks, and the CPython cells underneath lexical closures.
Editorial policy
No listicles. No folklore. No just trust me abstractions.
Every note should leave you with a better model of the system, not just another snippet to paste.