Complete archive
Archive
3,240 articles, newest first · page 27 of 54. For subject-based browsing use topics; for keyword lookup try search. Dates shown are assigned archive dates that order the library; they are not historical publication records.
-
2025
Jul 19, 2025 Detecting Deadlock Across Nodes Without a Shared Wait-For Graph How distributed deadlock detection assembles wait-for edges from independent lock managers, why stale edges produce phantom cycles, and what a timeout costs instead. distributed systems · intermediate - Jul 19, 2025 Heap Tuple Headers, Transaction Identifiers, and Visibility Rules How a row version records the transaction that created it and the one that deleted it, and how a reader decides whether that version belongs in its snapshot. databases · intermediate
- Jul 19, 2025 Hyperplane Structure in Linear Congruential Generators Why successive outputs of a congruential generator lie on a small number of lattice planes, how the spectral test scores that defect, and what state size buys in a modern generator. scientific computing · foundational
- Jul 18, 2025 Admission-Time Verification and Digest Pinning What a cluster can check between a pod specification and an image pull, why the kubelet is the wrong place for that check, and how digest pinning interacts with tag resolution order. virtualization · advanced
- Jul 18, 2025 Computing the Flash Threshold: Luminance Steps, Area, and the Red Flash Rule Photosensitive seizures depend on the size, luminance delta, and frequency of a flashing region; how the general and red flash thresholds are defined, and why a small bright animation is a different risk from a full-screen one. accessibility · advanced
- Jul 18, 2025 Forecasting Table and Index Growth from Row Width and Page Fill Turning tuple width, page overhead, fill factor, and index amplification into a byte forecast, and the four effects that make a linear extrapolation wrong. databases · advanced
- Jul 18, 2025 Link Aggregation Member Selection and the Mismatches That Stall It How frames are hashed onto bundle members, why a single flow cannot exceed one link, and which LACP negotiation failures leave a bundle passing some traffic. networking · intermediate
- Jul 18, 2025 The QUIC Handshake: TLS 1.3 Without a Record Layer How CRYPTO frames carry the TLS handshake inside the transport, why encryption levels change mid-handshake, and how Retry forces address validation before a certificate is sent. internet protocols · intermediate
- Jul 17, 2025 Error Budget Units: Why Burn Rate Beats Remaining Budget How a budget derived from a target becomes a rate, why the rate is comparable across services with different targets, and where the arithmetic breaks at low volume. observability · foundational
- Jul 17, 2025 Memory Protection Units on Microcontrollers and Stack Overflow Detection How an MPU partitions a small address space into regions with access attributes, why guard regions catch a stack overflow at the fault rather than later, and what the unit cannot protect. embedded systems · advanced
- Jul 17, 2025 SYN Cookies and the Cost of Half-Open Connections How a server avoids storing state for every handshake attempt by encoding the connection parameters into the initial sequence number, and what the encoding gives up. networking · advanced
- Jul 17, 2025 TTL Expiry and the Two Ways an Entry Dies How deadline-based caching separates logical expiry from physical reclamation, why lazy and active expiry put the cost in different places, and how clocks and replicas make a TTL a bound rather than a promise. backend systems · foundational
- Jul 17, 2025 What an API Doc Generator Can Recover From Source Alone Parsing and runtime introspection produce different documentation from the same code. Which one a toolchain uses decides what it can see, what it silently omits, and what it can never know. software engineering · intermediate
- Jul 16, 2025 Fragmentation, the MTU Floor, and Path MTU Discovery Black Holes How a datagram is split into pieces that a smaller link can carry, why the reassembly rules create ambiguity, and the specific way discovery fails when ICMP is filtered. networking · intermediate
- Jul 16, 2025 fsync, fdatasync, and What Survives a Power Loss The durability calls promise different things about data and metadata, and a file entry needs a second call on its directory; where the guarantees stop on each filesystem. filesystems · advanced
- Jul 16, 2025 Live-Variable Analysis and the Backward Direction of Dataflow Liveness runs the dataflow equations against the edges, from uses back to definitions, and the difference between may-liveness and must-liveness decides which optimizations are legal. compilers · foundational
- Jul 16, 2025 Path Copying in a Copy-on-Write B-Tree How a single key update rewrites the nodes along one root-to-leaf path, why sibling splitting propagates upward, and what the node layout must guarantee. filesystems · intermediate
- Jul 16, 2025 What a Sysroot Actually Restricts in a Cross Build A sysroot rewrites some search paths and leaves others untouched. The layout it expects, the linker scripts that depend on it, and the routes by which host headers still reach the compiler. systems programming · foundational
- Jul 15, 2025 Discovered Dependencies and Depfile Header Tracking Compilers know which headers they include and the build graph does not, so the compile step is made to write its own dependency rule. How that file is produced, parsed, and kept from going stale. developer tools · intermediate
- Jul 15, 2025 Normative and Informative Text in a Specification Why specifications split their prose into requirements and commentary, how normative keywords bind an implementation, and where the split breaks down. computing history · foundational
- Jul 15, 2025 Stop-the-World Pauses and the False Suspicion They Cause Why a collector pause, a page-fault storm, or a hypervisor deschedule looks identical to a crash from outside, and how a process can tell the difference using only local evidence. distributed systems · advanced
- Jul 15, 2025 Wavelet Trees and Range Queries on Sequences How recursive bitvector partitioning answers range counting, quantile, and rank queries on a static sequence, and why the space is n log σ bits rather than an index per value. data structures · advanced
- Jul 14, 2025 CAN FD: Longer Payloads, a Faster Data Phase, and the Loop That Must Close in Time The frame format changes that let a CAN FD frame carry 64 bytes at a higher bit rate, and the transceiver symmetry requirement that limits how far the data phase can be pushed. embedded systems · advanced
- Jul 14, 2025 Stability Limits of Explicit Integration in Dynamics Why forward Euler and Verlet diverge above a step size bound, where the bound comes from, and how a hair or cloth solver stays stable past the limit that breaks a rigid-body integrator. computer graphics · advanced
- Jul 14, 2025 The ABA Problem in Treiber Stacks Why a single compare-and-swap suffices to push onto a Treiber stack but not to pop from it, what the address comparison cannot detect, and which remedies actually close the window. systems programming · intermediate
- Jul 14, 2025 What a Sleep Mode Actually Turns Off The clock, regulator, and bias changes behind the named low-power states on a microcontroller, and why the deepest state is rarely the cheapest one to use. embedded systems · foundational
- Jul 12, 2025 Monadic Sequencing and the Encoding of Effects Why an effectful program is a value describing actions, how bind sequences those descriptions, and what the monad laws do and do not guarantee. programming languages · advanced
- Jul 11, 2025 Bisect Over a Rewritten History How bisect picks the next commit to test, why merge-heavy and rewritten histories distort the search, and what makes a bisect result trustworthy. software engineering · advanced
- Jul 11, 2025 Bit-Banding: Atomic Single-Bit Access Through an Alias Address Region How the Cortex-M3 and M4 alias one bit of memory to a whole word, what address arithmetic maps bit to word, and why the feature disappeared from later cores. embedded systems · advanced
- Jul 11, 2025 Heartbeat Interval and Timeout Arithmetic for Fixed-Threshold Detectors How the choice of heartbeat period and missed-beat threshold sets false-positive rate, detection latency, and message volume at the same time, and why the tail of the delay distribution decides everything. distributed systems · foundational
- Jul 10, 2025 Choosing an Objective Function for a Mixed Workload Means, percentiles, and goodput weight a workload mix differently, so the objective determines which optimization looks best before any measurement is taken. performance engineering · advanced
- Jul 10, 2025 PE/COFF Relative Virtual Addresses and the Import Directory How the Windows loader resolves addresses without a link-time base, what an RVA is relative to, and why the import table is a tree of small structures with no fixed total size. systems programming · intermediate
- Jul 9, 2025 Cursor Pagination and the Cost of Deep Offsets Why OFFSET grows linear in page depth, how keyset predicates keep page cost flat, and what an opaque cursor has to carry to stay correct. backend systems · intermediate
- Jul 9, 2025 Dead Letter Queues and Poison Message Quarantine Which failures deserve another attempt, how a broker counts attempts without understanding the error, and why the quarantine queue needs an owner and a bound. backend systems · advanced
- Jul 7, 2025 Parallel Tree Hashing and the BLAKE3 Design How chunk trees, parent nodes, and a stack of subtree roots convert a sequential hash into a parallel one, and what the tree structure costs in digest size and complexity. cryptography · intermediate
- Jul 7, 2025 Permutation Equivariance in Self-Attention and What Position Encodings Restore Why an attention layer treats a sequence as a set, the exact symmetry group it is invariant to, and how absolute, relative, and rotary encodings break that symmetry differently. deep learning · foundational
- Jul 6, 2025 Calibrating Interval Estimates Against Recorded Outcomes What an eighty percent interval promises, how coverage is measured on small samples, why width must be scored alongside the hit rate, and how reference classes supply the correction. software engineering · intermediate
- Jul 5, 2025 Cardinality Control in Metric Pipelines Why label combinations explode faster than series limits expect, how aggregation drops dimensions, and what a pipeline can do when the limit is already exceeded. observability · intermediate
- Jul 4, 2025 Alignment, Padding, and Over-Aligned Allocation What the alignment guarantee on a returned pointer actually promises, how allocators satisfy requests stronger than the ABI default, and why page-granular requests behave differently. memory systems · advanced
- Jul 4, 2025 Forecasting Exhaustion for Saturation Alerts How a linear projection over a recent window turns a saturation alert from a percentage threshold into a deadline, why the projection is only valid for a bounded horizon, and where it breaks. observability · advanced
- Jul 4, 2025 Reconciling a Load: Counting Rows Is the Weakest Possible Check A row-count comparison agrees on many wrong tables, so reconciliation has to compare keys, then values, and needs a position to compare at. data engineering · advanced
- Jul 4, 2025 The Table Model, Foster Parenting, and Header Association Loose table markup is rebuilt into thead, tbody, and tr by the parser, stray content is moved out, and the header association algorithm decides which cell describes which. web platform · intermediate
- Jul 3, 2025 Chunk Boundaries Decide What Can Be Retrieved How fixed-size, sentence, and structural chunking place boundaries, what overlap recovers and what it duplicates, and why the split point is an index-time commitment. inference systems · foundational
- Jul 3, 2025 Header Limits, Deadlines, and Slow-Connection Defence Why an attacker who sends one byte a second ties up more than CPU, how absolute deadlines differ from per-read timeouts, and what limits a server has to count. backend systems · intermediate
- Jul 3, 2025 Momentum and Nesterov Acceleration in Gradient Descent How velocity terms turn the gradient sequence into a filtered signal, why the quadratic case admits a closed-form optimal damping, and what breaks when gradients are noisy or the objective is not convex. machine learning · foundational
- Jul 3, 2025 Reconciliation: Turning a Declarative Description into Minimal Mutations How a framework compares two descriptions of the same interface to derive a small set of mutations, and why the comparison is a linear heuristic rather than an exact tree edit distance. mobile computing · foundational
- Jul 2, 2025 Backpressure and Loss at the Collection Boundary Why a log shipper must choose between blocking the application and dropping records, and how buffer sizing, disk queues, and drop accounting change that choice. observability · intermediate
- Jul 2, 2025 Collective Buffering and Two-Phase I/O for Parallel Checkpoints Why many ranks writing separate files is the wrong shape, how two-phase I/O regroups data into stripe-aligned chunks, and what the file system consistency rules allow. scientific computing · advanced
- Jul 2, 2025 CSP Nonces and the Script Gadgets That Survive Them How a nonce marks the scripts a policy permits, why whitelisting a host also authorises every script on it, and how existing library code becomes an execution path. security · intermediate
- Jul 2, 2025 Sort-Based and Hash-Based Shuffle Implementations Two ways to build the map-side shuffle output, how each one trades sort CPU for file count, and why the file count grows with the reduce task count. data engineering · intermediate
- Jul 2, 2025 Stack Unwinding and DWARF Call Frame Information How a frame is described by bytecode in .eh_frame, what the unwinder reconstructs at each step, and why a missing unwind table turns an exception into a terminate call. systems programming · advanced
- Jul 1, 2025 Online Resharding: Moving a Range Without Stopping Writes How a range is migrated while it is being written to, why the cutover is a metadata transaction, and what the dual-write window costs in correctness. databases · intermediate
-
June
Jun 30, 2025 How Assertion Libraries Recover Operands From a Failed Comparison Four mechanisms for turning a failed comparison into a readable message: preprocessor stringification, source rewriting, explicit operand passing, and post-mortem introspection. developer tools · foundational - Jun 29, 2025 Linear Scan Allocation over Sorted Live Intervals How a single pass over intervals ordered by start point assigns registers, why active-list eviction beats spilling the current interval, and what the interval approximation gives up. compilers · intermediate
- Jun 29, 2025 SwissTable Control Bytes and Group-Wise Probing How a one-byte tag per slot lets a lookup reject fifteen candidates with one SIMD comparison, and why metadata separate from keys changes the memory hierarchy. data structures · advanced
- Jun 29, 2025 Tolerant Parsing and Its Limits What the robustness principle actually licenses, where lenient receivers create security and interoperability problems, and how specifications narrow the tolerance they once encouraged. internet protocols · intermediate
- Jun 28, 2025 Keeping a Threat Model Current When the System Changes How to bind threats to the artifacts that encode their assumptions, what invalidates a model silently, and how diffing architecture against model finds the stale entries before an audit does. security · advanced
- Jun 28, 2025 Query Segmentation into Phrases for Ranked Retrieval Why a query without quotes still contains phrase structure, how segmentation models recover it, and what changes when segments are scored as units instead of loose terms. information retrieval · intermediate
- Jun 26, 2025 Field Splitting, IFS, and the Difference Between "$@" and $* The expansion order POSIX mandates, why an unquoted variable becomes several arguments, and which quoting forms actually preserve a filename with a space in it. developer tools · intermediate
- Jun 26, 2025 How Seven Namespaces Compose Into a Container Each namespace type isolates a different resource table, and the order and ownership of unshare calls determine what a process can still see. virtualization · intermediate