Complete archive

Archive

3,240 articles, newest first · page 8 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.

2026
Jul 6, 2026 Lookup Tables, Carry Chains, and the Routing Fabric How a configurable logic cell implements arbitrary Boolean functions from SRAM bits, why adders get a dedicated carry path, and why interconnect rather than logic sets the achievable frequency. hardware engineering · foundational
Jul 6, 2026 Nine Permission Bits, Three Classes, and No Way to Deny How the mode word is checked at open time, why umask subtracts rather than assigns, and what setuid, setgid and the sticky bit change about the check. computing history · intermediate
Jul 6, 2026 Storing Traces: Two Access Patterns That Cannot Share One Index Why a trace store must support both point lookup by trace identifier and time-range search by service, how indexes serve each, and where retention and cost force the two apart. observability · advanced
Jul 5, 2026 Feature Scaling and the Conditioning of Gradient Descent How per-feature magnitude sets the condition number of a loss surface, why that number fixes the iteration count of first-order methods, and what each scaler costs. machine learning · foundational
Jul 5, 2026 Recurrences as DAGs: Why Optimal Substructure Makes Tables Work How a recurrence defines a graph of states, why overlapping subproblems collapse an exponential recursion tree into a polynomial one, and where the optimal-substructure argument fails. algorithms · foundational
Jul 4, 2026 Chained Jobs and Fan-In Completion Without a Coordinator How a job that spawns children can know when they are all finished, why the counter must count terminal outcomes rather than successes, and how the successor is triggered exactly once. backend systems · advanced
Jul 4, 2026 Constrained Delegation and Token Exchange in OAuth 2.0 How the token exchange grant carries a subject through a chain of services, what scopes and audience restrict, and why impersonation and delegation differ in what the audit log records. security · advanced
Jul 4, 2026 Custom Widgets Over Virtualized Content When only the visible window of a list exists in the DOM, the accessibility tree holds a fragment of the data. Position, size, and the active item have to be reported through attributes rather than structure. accessibility · advanced
Jul 3, 2026 Consistent Orientation and Signed Volume From a Triangle Mesh How triangle winding encodes which side of a surface is outside, how to propagate it across a mesh, and how the divergence theorem turns an oriented mesh into a volume. computer graphics · foundational
Jul 3, 2026 Delta Cycles and the Stratified Event Queue in HDL Simulation Why an event-driven simulator orders zero-delay updates by region rather than by source text, how combinational feedback stalls simulated time, and which races the queue does not prevent. hardware engineering · foundational
Jul 3, 2026 Forward Diffusion as Closed-Form Gaussian Corruption How a fixed Markov chain turns any sample into noise in a fixed number of steps, why the cumulative transform is Gaussian in closed form, and what that buys for training. deep learning · intermediate
Jul 3, 2026 The Combobox Popup Contract: Ownership, Focus, and Announcement What a text input and its suggestion list must agree on to be one widget: the popup relationship, where DOM focus lives during typing, and who announces the active option. accessibility · intermediate
Jul 2, 2026 Alignment, Overflow, and Scroll Containers How alignment distributes free space inside a box, what overflow values do to the box model, and why one axis cannot stay visible when the other scrolls. web platform · advanced
Jul 2, 2026 Immediate Encoding and How Arbitrary Constants Get Materialized Why an instruction can hold only a small constant, how sign extension and scaled fields are packed into the word, and the instruction sequences that build a full-width value. computer architecture · intermediate
Jul 2, 2026 Length Extension and Prefix-Free Message Encoding Why an iterated hash can be continued from its own digest, how the attack reconstructs unknown input from output alone, and which encodings close the hole. cryptography · intermediate
Jul 2, 2026 The Screen Reader Announcement Pipeline How a screen reader turns an accessibility-tree event into spoken output, from event dispatch through speech synthesis, and where latency and interruption come from. accessibility · foundational
Jul 1, 2026 Bitmap Memory and the Cost of Decoding at Full Resolution The byte arithmetic behind image memory, why a decode allocates more than the file size, and how sample size and format conversion change both the footprint and the time. mobile computing · intermediate
Jul 1, 2026 Join Dependencies and the Ternary Structure Fifth Normal Form Protects Why a relation can be pairwise lossless and still not be a join of two projections, how a three-way join dependency arises from a cyclic constraint, and what 5NF removes. databases · advanced
June
Jun 30, 2026 Durable Append: Group Commit, Torn Tails, and Recovery What fsync actually orders, why a log file needs a per-record checksum, and how batching many appends into one flush changes the latency of every record. observability · advanced
Jun 29, 2026 Errata, Revisions and the Exit Problem for a Standard How published specifications are corrected and withdrawn, why deprecation is not deletion, and what happens when the authority for a document disappears. computing history · advanced
Jun 29, 2026 Multiwindow Burn-Rate Alerts and Why a Short Window Also Suppresses How pairing a long lookback with a short confirmation window yields both fast detection and durable alerts, and what the boolean pairing costs in edge cases. observability · intermediate
Jun 29, 2026 Pooling as a Downsampling Operator and Its Signal Effects What max and average pooling actually compute, why stride-based subsampling aliases, and how the backward pass routes gradient through a non-differentiable maximum. deep learning · intermediate
Jun 29, 2026 Restartable Sequences and Interruption Semantics How the kernel restarts an interrupted call, why a userspace critical section needs a kernel abort hook, and what the abort path guarantees. operating systems · advanced
Jun 29, 2026 What a Commit Contains and Why Its Hash Is Content-Addressed The four object types, the exact bytes a commit hash covers, and why editing one old file rewrites every descendant hash. software engineering · foundational
Jun 29, 2026 Working Memory Limits as a Constraint on Form Structure How chunking, recognition over recall, and progressive disclosure keep the number of simultaneously held items inside a plausible working memory budget, and where the chunking argument is misapplied. accessibility · advanced
Jun 28, 2026 Change-Based Test Selection and Where It Stops Being Sound How dependency graphs and per-test coverage traces map a diff to a subset of tests, why dynamic selection cannot see new coverage gaps, and why selection tools fail open. developer tools · advanced
Jun 28, 2026 Timeout Budgets, Deadline Propagation, and the Arithmetic of Retry Amplification How a timeout that is short relative to the service latency turns into extra load, why retries must be bounded per request rather than per attempt, and how a remaining-time budget propagates across tiers. performance engineering · advanced
Jun 27, 2026 Arithmetic Coding by Interval Subdivision How a message becomes a single rational interval, why the decoder needs no codeword boundaries, and what finite-precision renormalization must do to keep the arithmetic exact. computation theory · intermediate
Jun 27, 2026 Forward Error, Backward Error, and Condition Numbers Separating what the algorithm got wrong from what the problem amplifies, why the rounding model hands over a backward error for free, and how a small residual can still mean a wrong answer. scientific computing · advanced
Jun 27, 2026 Layered Architecture and the Cost of Strict Layer Isolation How an allowed-to-use relation constrains a layered system to one dependency direction, what sink layers permit, and what every pass-through boundary charges in mapping code. software architecture · foundational
Jun 27, 2026 Spatial Reuse, OBSS Interference, and BSS Coloring Why overlapping cells defer to each other even when they could transmit, what the preamble carries to fix it, and how a colour is chosen without coordination. networking · advanced
Jun 27, 2026 The Close-on-Exec Race and Why Descriptor Inheritance Is a Hazard How exec preserves every descriptor a process holds, why setting the flag after fork is too late, and what O_CLOEXEC closes that fcntl cannot. computing history · advanced
Jun 26, 2026 API Versioning and the Mechanics of Schema Evolution Which schema changes are actually breaking, where a version identifier belongs, and how deprecation windows and data migrations interact with old clients. backend systems · intermediate
Jun 26, 2026 Bottom-Up Heap Construction in Linear Time Why sifting down from the middle of the array builds a heap in O(n) rather than O(n log n), and how the node-counting argument bounds the total work. data structures · foundational
Jun 26, 2026 Copy-on-Write and Block Shadowing Instead of a Log How never modifying a reachable block replaces journal replay with a root pointer swap, and what the tree-copying cost buys in atomicity. filesystems · intermediate
Jun 26, 2026 Mark-Sweep and the Fragmentation It Leaves Behind How a sweep pass rebuilds allocatable space, why segregated free lists and size classes delay the fragmentation problem rather than solve it, and what coalescing costs. language runtimes · foundational
Jun 26, 2026 Stack Unwinding Without Frame Pointers: Call Frame Information How a debugger or profiler recovers caller frames from a stripped, optimised stack by interpreting DWARF CFI rules instead of walking a saved frame pointer chain. systems programming · intermediate
Jun 26, 2026 Store-and-Forward Delivery and the MX Indirection How mail separated the address a sender writes from the host that receives it, why transfer is hop-by-hop rather than end-to-end, and what the retry rules actually require. computing history · intermediate
Jun 25, 2026 Fanout, Height, and Why B-Trees Stay Shallow How page size, key width, and pointer width determine the branching factor of a B-tree, and why three or four levels cover billions of keys. databases · foundational
Jun 25, 2026 Mercury Delay-Line Memory and the Timing It Imposed How acoustic pulses recirculating in mercury hold a bit stream, why access time depends on the address, and what that forced on instruction placement and memory layout. computing history · advanced
Jun 25, 2026 The Sequent Calculus and Why Its Rules Are Invertible How Gentzen's sequent presentation differs from natural deduction, why left and right rules can be read backwards for proof search, and what the cut rule adds. computation theory · foundational
Jun 24, 2026 Capabilities and the Decomposition of Root Privilege How the single root check was split into distinct capabilities, how the permitted, effective and inheritable sets interact across execve, and why file capabilities and no_new_privs change the rules. operating systems · intermediate
Jun 24, 2026 Interposing on malloc: How Allocation Tracing Hooks a Heap How a tracing layer replaces malloc and free without editing the program, why the replacement must not call the functions it replaces, and which allocations escape interposition entirely. memory systems · foundational
Jun 24, 2026 Mixed-Version Operation: What Two Versions Must Agree On Why every rolling upgrade temporarily runs two builds at once, which interfaces must be bidirectional across that window, and how expand-migrate-contract keeps them so. distributed systems · foundational
Jun 24, 2026 Windowed Drift Detection and the Arithmetic of Its Alarms Comparing a live feature distribution against a reference is a two-sample test on a window, and the window length, the binning, and the number of features being tested together determine how often the alarm fires with nothing wrong. inference systems · intermediate
Jun 23, 2026 Catmull-Clark Subdivision and What the Limit Surface Actually Is The three averaging rules that turn a control cage into quads, why extraordinary vertices break the bicubic patch analogy, and how to evaluate the limit without subdividing. computer graphics · intermediate
Jun 22, 2026 CPU Affinity Masks and What Pinning Actually Costs How a task affinity mask restricts the scheduler, why pinning a thread can lower latency and raise queueing at the same time, and what the load balancer does when every task is pinned. memory systems · intermediate
Jun 22, 2026 Dirty Page Rate and the Convergence Condition Pre-copy migration only terminates when the guest dirties memory slower than the link can carry it. The ratio of those two rates decides the pass count, the total data moved, and whether the migration finishes at all. virtualization · foundational
Jun 22, 2026 Garbage Collection and Where Write Amplification Comes From Why reclaiming an erase block copies live pages, how the victim-selection policy sets the copy cost, and the closed-form relation between free space and amplification. filesystems · foundational
Jun 22, 2026 Graceful Shutdown and the Ordering of Connection Draining The sequence a server must follow to stop without dropping requests, why a closed listening socket resets queued connections, and how drain deadlines are sized. backend systems · advanced
Jun 22, 2026 Halo Exchange and the Surface-to-Volume Tax on Domain Decomposition How ghost layers turn a stencil update into communication, why block decompositions beat slabs at scale, and where the ratio stops paying. scientific computing · intermediate
Jun 22, 2026 How a Preemptive RTOS Scheduler Picks the Next Task The ready-list, priority comparison, and context switch path a fixed-priority kernel follows on every tick, and why the runnable set is the only structure that matters. embedded systems · foundational
Jun 22, 2026 Introsort: Bounding Quicksort with a Depth Counter and a Heap How a recursion-depth budget converts quicksort into a worst-case n log n algorithm, and why heapsort is the fallback rather than merge sort. algorithms · advanced
Jun 22, 2026 Merge Bases and the Three-Way Merge Walk Why a merge needs a common ancestor, how the best common ancestor is chosen, and what the diff3 procedure does when both sides touch the same region. developer tools · intermediate
Jun 22, 2026 Normalisation by Evaluation for Conversion Checking How to decide equality of terms by evaluating them into a semantic domain of closures and neutral values, and why this avoids the quadratic cost of substitution. computation theory · intermediate
Jun 22, 2026 Prompt Cache Economics: Hit Rate, Prefix Length, and Break-Even What a cache hit actually saves, how prefix granularity bounds the achievable hit rate, and where cache storage competes with concurrency for the same memory. inference systems · intermediate
Jun 21, 2026 Affine Quantization: Scale, Zero Point, and the Error They Introduce How a real-valued tensor is mapped onto a small integer grid, why the zero point exists, and where the rounding error lands inside a dot product. inference systems · foundational
Jun 21, 2026 Concurrent Readers on a Mutating Trie Lookups traverse many dependent loads, so per-node locking is untenable. How publish-then-swap, deferred reclamation, and path copying keep readers safe while nodes grow and split. data structures · advanced
Jun 21, 2026 Conffile Conflicts During Package Upgrades How dpkg and rpm decide whether a configuration file has been edited locally, why neither will merge, and how unattended upgrades end up keeping stale configuration. devops · foundational
Jun 21, 2026 Propagating Template Changes Across an Instantiated Fleet Once a golden path has been copied a hundred times, a change to the template is a migration. Three propagation models, the merge conflicts each produces, and how to make a breaking template change survivable. virtualization · intermediate

2026

June