A reference library for software practitioners
How computing systems
actually work.
Long-form explanations of the mechanisms beneath modern software — from asymptotic analysis and cache behaviour to consensus protocols, query planners, and memory safety. Written to be read closely, cited, and revisited.
3,240articles published
40subject domains
324topic clusters
Latest
All articles →- Oct 25, 2026 Signed Repository Metadata and the Compromise-Resistant Update Protocol Why a signature on the artifact is not enough, how role-based metadata separates signing keys by function, and what the freshness and freeze defences cost in round trips. software engineering · dependencies
- Oct 24, 2026 BGP Sessions and Route Propagation over Hybrid Links How a gateway exchanges prefixes with a customer network over a dedicated link, why the AS path and local preference determine the winner, and how a flapping session poisons a route table. cloud infrastructure · cloud networking
- Oct 24, 2026 Conditioning, Tolerances, and the Digits a Reproduction Can Demand How the condition number sets the width of the interval a computed result actually occupies, and how that interval determines which differences between two runs are meaningful. scientific computing · reproducible research
- Oct 24, 2026 How a DFA Decides Membership: Transition Tables and the Extended Transition Function The five-tuple, the recursive lift of the transition function to whole strings, and the table layouts that make each input symbol cost one dependent load. computation theory · automata
- Oct 24, 2026 Signals as Deferred Interrupts and the Async-Signal-Safe Subset How a signal handler interrupts an arbitrary instruction, why most library calls are unsafe inside one, and what the small permitted subset actually guarantees. computing history · unix lineage
- Oct 23, 2026 Balance Factors, and Why AVL Deletion Cascades How two bits per node encode the AVL invariant, why an insertion repair stops at the first rotation while a deletion repair can climb to the root, and what the child balance factor decides. data structures · balanced trees
- Oct 23, 2026 How a Loadable Module Resolves Symbols Against the Kernel A module is an unlinked ELF object, not a program. How the loader binds its undefined names, why exported symbols carry version CRCs, and what vermagic refuses to load. operating systems · kernel engineering
- Oct 23, 2026 Precedence Climbing for Binary Expressions How a loop with a minimum-binding-power parameter parses operator precedence and associativity in one function, and how its behaviour maps onto the grammar it replaces. compilers · lexing and parsing
- Oct 23, 2026 Quorum Intersection: Why R + W > N Is Necessary but Not Sufficient What the quorum inequalities actually prove about read-write overlap, why they say nothing about the newest value, and where per-key quorums break down across a cluster. databases · replication and sharding
- Oct 23, 2026 Refresh Token Rotation and Replay Detection How rotating refresh tokens limit the value of a stolen credential, why a used token presented twice means compromise, and how a grace window keeps honest clients from tripping the alarm. backend systems · session and state
- Oct 23, 2026 Setup and Hold Slack: Reading a Static Timing Report How arrival and required times are propagated through a timing graph, why setup and hold checks run in opposite directions, and how skew, derating, and path exceptions change the verdict. hardware engineering · hdl and synthesis
- Oct 23, 2026 Testing DFA Equivalence with Union-Find Instead of a Product Table Why two machines accept the same language exactly when no reachable pair is split by acceptance, and how merging pairs in a disjoint-set structure avoids building the product. computation theory · automata
Where to start
All topics → Algorithms Correctness, cost, and the design techniques behind efficient computation. Accessibility Interfaces that work for people with diverse abilities. Backend Systems Server-side request handling, state, and messaging. Cloud Infrastructure Elastic compute, storage, and network as programmable resources. Compilers From source text to machine code, stage by stage. Computation Theory Models of computation and the limits they impose. Computer Architecture How processors turn instructions into work. Computer Graphics Modeling light, geometry, and images.
Complete index
- Algorithms 120
- Data Structures 80
- Computation Theory 80
- Programming Languages 80
- Compilers 80
- Language Runtimes 80
- Operating Systems 80
- Memory Systems 80
- Filesystems 80
- Computer Architecture 80
- Hardware Engineering 80
- GPU Computing 80
- Embedded Systems 80
- Networking 80
- Internet Protocols 80
- Distributed Systems 80
- Databases 80
- Data Engineering 80
- Software Engineering 80
- Software Architecture 80
- Web Platform 80
- Backend Systems 80
- Mobile Computing 80
- Cloud Infrastructure 80
- Virtualization 80
- Cryptography 80
- Security Engineering 80
- Machine Learning 80
- Deep Learning 80
- Inference Systems 80
- Observability 80
- Performance Engineering 80
- DevOps 80
- Developer Tools 80
- Scientific Computing 80
- Computer Graphics 80
- Information Retrieval 80
- Accessibility 80
- Systems Programming 80
- Computing History 80