Complete archive
Archive
3,240 articles, newest first · page 4 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
Sep 9, 2026 UV Chart Packing and Why Gutters Are Measured in Texels How unwrapped charts are rotated and packed into one atlas, what determines the padding between them, and why a bilinear tap can bleed across an island. computer graphics · intermediate - Sep 8, 2026 Concurrent Composition and the Isolation Assumption Why a protocol proved secure alone can fail when run beside another, how session identifiers and key separation restore isolation, and where composition theorems stop applying. cryptography · advanced
- Sep 8, 2026 Inferred Latches: Why an Incomplete Branch Becomes State How a combinational block that fails to assign its output on every path forces the synthesis tool to infer a level-sensitive latch, and which coding shapes create that condition. hardware engineering · foundational
- Sep 8, 2026 Thread-per-Connection, Event Loops, and the Cost of Blocking What a blocked read consumes in each concurrency model, why readiness notification changes the shape of the code, and where each approach fails under load. backend systems · intermediate
- Sep 8, 2026 Virtualized Performance Counters and the Time They Do Not Count How a guest gets access to a PMU, what context switching the counters costs, and why the cycles reported inside a guest systematically omit the time the hypervisor spent on its behalf. virtualization · advanced
- Sep 8, 2026 When a Blocking Call Enters an Asynchronous Runtime A blocking system call inside a task stalls the carrier thread and every task queued behind it. What detection is possible, what a blocking pool costs, and why the boundary is drawn at the library. language runtimes · intermediate
- Sep 7, 2026 Schema Evolution and Wire Compatibility Across Formats Why a field number rather than a name is a message field identity, how wire types constrain which retyping is safe, and how Avro resolution differs from Protobuf evolution. software architecture · advanced
- Sep 6, 2026 Priority and Fair Queueing for Mixed Traffic How strict priority starves low classes, how deficit round robin allocates bandwidth by packet size, and how the two combine on an access link. networking · advanced
- Sep 6, 2026 Receptive Field Arithmetic and Effective Coverage How a unit back-propagates to the input positions that influence it, why the theoretical field overstates the real one, and how dilation and stride change the recurrence. deep learning · foundational
- Sep 5, 2026 Adaptive Step Sizes: AdaGrad, RMSProp, and Adam How per-coordinate accumulators of squared gradients rescale the update, why the resulting methods needed repair to keep their convergence guarantees, and what the state costs. machine learning · intermediate
- Sep 5, 2026 Branch Lifetime and the Cost of Divergence How branch age affects conflict size, merge base distance, and review quality, and what integration frequency changes mechanically rather than culturally. software engineering · intermediate
- Sep 5, 2026 Deterministic Checks That Keep a Documentation Build Honest A build can verify markup, references, examples, and terminology without judgement. Separating those mechanical assertions from editorial taste is what makes a failing build mean something. software engineering · intermediate
- Sep 5, 2026 The Arithmetical Hierarchy and the Turing Jump How undecidable problems are graded by the number of quantifiers needed to express them, why the halting set generates every level, and what Post’s theorem says about the resulting ladder. computation theory · advanced
- Sep 4, 2026 Process Groups, Sessions, and the Mechanics of Job Control Why Ctrl-C reaches a whole pipeline at once, what a background job actually is, and which kernel structures the shell manipulates to make fg and bg work. developer tools · intermediate
- Sep 3, 2026 Content Digests and Why an Image Tag Is Not an Identity How a digest names image bytes rather than a name, what the verification chain from tag to unpacked filesystem actually checks, and where that chain is weaker than it looks. virtualization · foundational
- Sep 3, 2026 Error Correction in NAND: From Hard Bits to Soft Read Retry How BCH and LDPC codes absorb the raw bit error rate of a flash page, why soft-decision decoding needs several reads at shifted reference voltages, and what happens when correction runs out. hardware engineering · intermediate
- Sep 3, 2026 Sequencing Repayment Under a Fixed Capacity With more debt than capacity, the order of repayment determines the total benefit. Ranking by interest eliminated per week of work, subject to deadlines and prerequisites. software architecture · advanced
- Sep 3, 2026 Text Measurement and Line Breaking in Layout How a layout engine turns a string, a font, and a width into glyph positions, why shaping cannot be done per character, and how the break opportunity rules interact with measurement. mobile computing · intermediate
- Sep 2, 2026 Partition Statistics as Validation Signals Per-partition row counts, byte sizes, and file counts are metadata, so checking them costs almost nothing; the hard part is knowing which deviation means which fault. data engineering · intermediate
- Sep 2, 2026 Streams, Events, and Concurrent Kernel Execution What a stream actually orders, why two kernels can overlap or fail to, and how events turn a stream of launches into a dependency graph. gpu computing · advanced
- Sep 2, 2026 Structuring a Game Day: Scenario, Roles, and Safety Nets What separates a drill from an experiment, how a scenario document is written so that it constrains the fault and not the response, and the safety nets that must exist before the exercise starts. devops · advanced
- Sep 1, 2026 Latency Hiding and the Arithmetic of Warp Counts Deriving how many resident warps are needed to cover a memory stall from instruction count and latency, and where the Little's law model overstates what interleaving can deliver. gpu computing · intermediate
- Sep 1, 2026 NURBS Knot Vectors and What Rational Weights Do How a knot vector fixes the basis, why homogeneous coordinates let one polynomial form describe exact circles, and what non-uniform spacing costs downstream. computer graphics · intermediate
- Sep 1, 2026 Policy Routing: Keying the Lookup on More Than the Destination How multiple routing tables and a rule list restore source-based and interface-based selection, what the extra lookup costs, and why asymmetric paths become routine. networking · advanced
- Sep 1, 2026 Power Density and the Dark Silicon Constraint Why a chip can contain more transistors than its power budget can switch at once, how that forces area to be specialised, and what fraction of a die can be active at any instant. computer architecture · intermediate
- Sep 1, 2026 The Split-Sum Approximation for Specular Image-Based Lighting How a prefiltered environment map plus a two-channel BRDF lookup table replaces a per-shading-point integral, what assumptions the factorization hides, and where the grazing-angle error appears. computer graphics · advanced
- Sep 1, 2026 Three-Way Merge and How the Merge Base Is Chosen Why merging compares two tips against a common ancestor rather than against each other, how the base is selected when history is criss-crossed, and where the approach loses information. software engineering · foundational
-
August
Aug 31, 2026 Spinlock Contention: Ticket Ordering and MCS Queues Why a test-and-set spinlock makes every waiter hammer one cache line, how a ticket lock restores first-come order, and why a queue of per-thread flags beats both. operating systems · intermediate - Aug 30, 2026 Dependency Structure Matrices and the Cost of a Cycle How a square matrix over modules exposes layering and reachability at a glance, how partitioning recovers a build order, and what a cycle costs once it is found. software architecture · foundational
- Aug 29, 2026 Trakhtenbrot’s Theorem and the Finite Model Boundary Why first-order validity over all structures and over finite structures are both undecidable but for opposite reasons, and how a sentence can encode an entire halting computation in one finite domain. computation theory · intermediate
- Aug 28, 2026 Consensus, Voting Rules and the Burden of an Objection How committee votes, comment resolutions and national-body ballots decide what a specification says, and why unanimity requirements produce vague text. computing history · foundational
- Aug 27, 2026 Execution Counts and the Hidden State of a Notebook Kernel Why the cells stored in a notebook file were not necessarily executed in the order the file shows, what the execution counter measures, and which parts of the state never reach the document. scientific computing · foundational
- Aug 27, 2026 Power, the Minimum Detectable Effect, and the Cost of Repeated Looks How sample size is determined by the smallest effect worth detecting rather than by convenience, why peeking at a running experiment inflates false positives, and what sequential designs cost in exchange. performance engineering · intermediate
- Aug 27, 2026 Squared, Absolute, and Quantile Loss Compared by Their Gradients How the shape of a regression loss decides which observations move the fit, why the absolute loss has no derivative at zero, and what the pinball loss estimates instead of a mean. machine learning · intermediate
- Aug 27, 2026 Storage Handoff: Moving a Guest's Disk With It Block devices cannot be frozen and copied like RAM. Either the disk stays put and is re-attached, or its contents move while the guest writes, and each option has a different consistency failure. virtualization · intermediate
- Aug 27, 2026 Stride, Misalignment, and the Cost of a Bad Layout How stride and alignment interact to add sectors to every warp request, why a row-major array accessed by column collapses bandwidth, and what a shared-memory transpose costs in return. gpu computing · foundational
- Aug 27, 2026 The Unit Step of Fabrication: Lithography, Etch, and Deposition How one patterned layer is built on a wafer: resist coating, exposure through a reduced reticle, development, etch or implant, and the overlay budget that ties every layer to the one below it. hardware engineering · foundational
- Aug 27, 2026 VFS Objects and the Operation Vector The four in-kernel objects every filesystem must supply, the function table each one carries, and how a single open() call ends up in a filesystem-specific method. filesystems · intermediate
- Aug 27, 2026 What a Sandbox Proof Establishes and What It Assumes How verification of a sandbox reduces the isolation guarantee to a set of machine-checked lemmas, where the specification gap appears, and why the assumptions are the part that matters. language runtimes · advanced
- Aug 26, 2026 Buffer Queue Depth and the Latency It Adds Between Touch and Photon How many buffers a surface holds decides whether the pipeline can overlap frames or must serialize, and why every extra buffer buys throughput with input latency. mobile computing · advanced
- Aug 26, 2026 Consistent Hashing and What Resharding Costs a Cache Tier Why modular hashing turns a single added node into a near-total cache flush, how ring and rendezvous schemes bound the keys that move, and what slot-based clusters still charge for rebalancing. backend systems · intermediate
- Aug 26, 2026 Exhaustive State Exploration and What a Bounded Model Proves How model checking enumerates reachable states, why a bound is a parameter of the claim rather than a shortcut, and how to read a counterexample as a requirement defect. software engineering · advanced
- Aug 26, 2026 im2col Expansion, FFT Convolution, and Winograd Transforms Three ways to turn a convolution into matrix arithmetic: what im2col replicates in memory, when the Fourier route wins, and what Winograd trades away in numeric range. deep learning · intermediate
- Aug 26, 2026 Objective Windows: Rolling Windows, Calendar Months, and Time Equivalence How the choice of measurement window changes what a target means, why a 28-day window is the conventional default, and how to convert a time-based target into a count-based one. observability · foundational
- Aug 26, 2026 Read-Modify-Write Atomicity and the Ordering It Carries Why an atomic increment cannot be built from a load and a store, what compare-and-swap costs in coherence traffic, and how an atomic operation acts as a fence. computer architecture · intermediate
- Aug 26, 2026 Register Pressure and the Spill into Local Memory Why the register file caps how many threads an SM can host, how the compiler trades registers for scattered memory traffic when it runs short, and why the spilled addresses still coalesce. gpu computing · intermediate
- Aug 26, 2026 Resource Exhaustion Faults: Memory, File Descriptors, and Inodes How memory pressure differs from allocation failure, why descriptor and inode exhaustion produce distinct error codes, and how control groups let a fault be applied without touching the host. devops · intermediate
- Aug 26, 2026 VLAN Segmentation and the Limits of Layer 2 Isolation How 802.1Q tags create separate broadcast domains on shared hardware, why trunk links and layer 3 boundaries decide whether isolation holds, and where VLAN hopping attacks get their leverage. security · foundational
- Aug 26, 2026 Write-Back, Write-Through, and the Cost of a Dirty Line How a cache decides whether a store waits for memory, what write-allocate does to a partial line, and why the dirty bit turns an eviction into a second transaction. memory systems · foundational
- Aug 25, 2026 Mesh Parameterization, Cuts, and the Distortion That Cannot Be Removed Mapping a surface to the plane requires cutting it into a disk, and every planar map of a curved surface must distort either angles or areas by a measurable amount. computer graphics · advanced
- Aug 24, 2026 A Sequential Focus Test Protocol How to record and verify tab order, focus visibility, and focus containment, and what tabindex values, inert subtrees, and dialogs do to the sequence. accessibility · intermediate
- Aug 24, 2026 First-Touch Placement and the Faulting Thread Why a page lands on the node of whichever thread first writes it, what the kernel actually does inside the fault handler, and how the choice of allocation policy changes that default. memory systems · foundational
- Aug 24, 2026 LU Factorization with Partial Pivoting and Element Growth How the pivot search bounds every multiplier by one, why that bound still does not bound the factors, and what the growth factor costs in practice. scientific computing · foundational
- Aug 24, 2026 Register Windows and Why Explicit Operand Registers Won How register window architectures eliminate spill code on call, what the window management traps cost, and why load-store ISAs settled on flat register files with fixed fields. computer architecture · intermediate
- Aug 24, 2026 Static Analysis Findings as a Review Signal What a linter or analyser can prove about a diff, how findings are ranked so that reviewers see the few that matter, and why suppression is the mechanism that decides whether any of it works. software engineering · advanced
- Aug 24, 2026 Symplectic Integrators and the Shape of Energy Drift Why a symplectic method does not conserve energy exactly but keeps it bounded, how the modified Hamiltonian explains the bound, and when a non-symplectic method can be better. scientific computing · advanced
- Aug 23, 2026 Template Rendering Under Variable Input: Determinism, Escaping, and Secret Leakage Why a configuration template can produce a different file from identical inputs, how quoting inside structured formats fails, and where rendered secrets end up on disk. devops · intermediate
- Aug 22, 2026 Operator Precedence Tables and Why They Are a Design Artifact How precedence is encoded in a grammar, why the table is not arbitrary, and what goes wrong when a new operator is fitted into an existing hierarchy. programming languages · foundational
- Aug 22, 2026 Temporal Coupling Between Services What a synchronous call forces on two services, how message passing changes the coupling without removing it, and where each style breaks under load. software architecture · intermediate
- Aug 22, 2026 Utilization and the Nonlinear Growth of Waiting Time Why queue delay rises faster than load, how the shape of the curve depends on service-time variability rather than on arrival statistics, and why a utilization target is a statement about tail risk. performance engineering · foundational