Complete archive
Archive
3,240 articles, newest first · page 15 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
Mar 14, 2026 Focus Order and the Accessibility Tree How tabindex, DOM order, and the tree order diverge, and why the tab sequence and the reading order are computed from different structures. accessibility · intermediate - Mar 14, 2026 Seqlocks: Optimistic Reading Without Blocking the Writer How a version counter lets readers copy shared data without registering, why the writer never waits, and which data types make the retry loop impossible to get right. operating systems · intermediate
- Mar 13, 2026 Alignment and Uniformity as Separate Objectives Contrastive losses can be decomposed into a term that pulls positive pairs together and a term that spreads all representations apart, and the two terms trade against each other in measurable ways. deep learning · advanced
- Mar 13, 2026 Compressed Sparse Row Storage and the Cost of Insertion How three flat arrays encode a sparse matrix, why the matrix-vector product is limited by memory rather than arithmetic, and why assembly happens in a different format. scientific computing · intermediate
- Mar 13, 2026 Fast BSS Transition and the Key Hierarchy That Makes Roaming Quick Why reassociating to a new access point normally costs a full authentication and key exchange, and how pre-derived keys cut that to two messages. networking · advanced
- Mar 13, 2026 Idempotency at the Effect Boundary, Not the Handler Entry Deduplicating a job at the point where it changes the world: unique constraints, request keys, delta-to-fact conversion, and the two-phase effect that survives a crash mid-call. backend systems · foundational
- Mar 13, 2026 Open File Descriptions and the Offsets They Share Three separate kernel objects stand behind a file descriptor, and knowing which one carries the offset explains dup, fork, append mode, and why two opens of one file disagree about position. filesystems · foundational
- Mar 13, 2026 Zone Bits and Why EBCDIC Letters Are Not Contiguous How a byte splits into a zone nibble and a digit nibble, why that layout leaves gaps inside the alphabet, and what the gaps cost in collation and character-set conversion. computing history · foundational
- Mar 12, 2026 Live Migration of a Guest That Holds a GPU Moving a running guest with an attached accelerator requires capturing device state, channel state, and page state in an order that leaves neither side with a stale view. gpu computing · advanced
- Mar 12, 2026 Rice’s Theorem and the Collapse of Semantic Properties Why every nontrivial property of the language a program computes is undecidable, how the proof smuggles a halting question into an arbitrary property, and which program properties escape the theorem. computation theory · intermediate
- Mar 12, 2026 Scheduling and Preemption on Accelerator Queues Why a device queue is a scheduling entity, how hardware contexts make preemption possible, and what mid-kernel eviction costs when the device has no save state. computer architecture · advanced
- Mar 10, 2026 Contextual Keywords and Extending a Grammar in Place How a language adds new syntax without reserving a word, why soft keywords are resolved by the parser rather than the lexer, and what the compatibility technique costs in ambiguity. programming languages · advanced
- Mar 10, 2026 The Transaction ID Horizon and What Happens at Wraparound How 32-bit transaction identifiers are consumed, why freezing exists, and the sequence of failures that turns a neglected counter into a refused-write outage. databases · advanced
- Mar 9, 2026 Counting Derivations: Algebraic Generating Functions and the Growth of Parse Trees A grammar can be compiled into a polynomial system whose power-series coefficients count parse trees, and the resulting algebraic function explains why ambiguity grows exponentially. computation theory · advanced
- Mar 9, 2026 Rolling Back a Stateful Serving Fleet Under Live Traffic Restoring an earlier model is simple until the serving fleet holds request state, warm caches, and in-flight streams; then the rollback itself becomes a state transition with its own failure modes. inference systems · intermediate
- Mar 8, 2026 Roving tabindex and Active Descendant Compared Two ways to give a composite widget one tab stop: moving tabindex among items, or keeping focus on a container and pointing at an item with aria-activedescendant. accessibility · intermediate
- Mar 8, 2026 Split Discovery and Why a Parallel Read Is Not a Consistent Read How a connector partitions a table into independently readable ranges, and why the boundaries it discovers are only correct if the key distribution does not change. data engineering · advanced
- Mar 7, 2026 Inode Tables and the Arithmetic of Inode Numbers How a fixed-size inode record is found from its number with one division, why the table is preallocated rather than grown, and what happens when the number of inodes runs out before the space does. filesystems · foundational
- Mar 6, 2026 Histogram Buckets, the +Inf Bucket, and How Quantiles Are Interpolated Why histograms store counts per bucket rather than values, how cumulative bucket counts make merging trivial, and what linear interpolation inside a bucket assumes about the distribution. observability · foundational
- Mar 6, 2026 Log Shipping and the Recovery Point Objective How the commit acknowledgement ladder sets the true data-loss window, why a WAL archive lags by a whole segment, and how to measure the gap rather than assume it. devops · intermediate
- Mar 6, 2026 Process Suspension and the Background Execution Grant Why a backgrounded process keeps its memory but loses its CPU, what suspension does to timers and sockets, and how the two clock sources diverge across device sleep. mobile computing · foundational
- Mar 5, 2026 Occupancy as a Latency-Hiding Budget How resident warps are rationed by registers, shared memory, and block granularity, and how to compute the number of concurrent requests a given occupancy can sustain. gpu computing · foundational
- Mar 4, 2026 Frame Pointers, DWARF Call Frame Information, and What Breaks When Both Are Absent Two ways to recover a call stack from a captured instruction pointer, the register and table costs of each, and the failure signatures that make a stack look valid when it is not. observability · foundational
- Mar 4, 2026 The Power Wall: Why Frequency Scaling Stopped How dynamic power depends on voltage and frequency, why Dennard scaling ended when the supply voltage stopped falling, and what replaced clock rate as the source of throughput. computer architecture · foundational
- Mar 4, 2026 Ubiquitous Language: Keeping One Term for One Concept in Code How naming drift between speech and source produces defects that survive testing, and what it takes to make the code use the same words the domain does. software architecture · foundational
- Mar 3, 2026 Deciding Whether a Policy Set Grants More Than Intended How an access policy becomes a logical formula, what an SMT solver can answer about it, and why the answer is only as good as the model of the request. cloud infrastructure · advanced
- Mar 3, 2026 Logical Dates, Interval Boundaries, and Catchup Semantics Why a scheduled run carries a date it did not start on, how intervals are made half-open, and what happens when the schedule falls behind. data engineering · intermediate
- Mar 3, 2026 Memory-Hard Functions and Password Hashing Costs Why a fast hash is the wrong primitive for storing passwords, how memory hardness changes the attacker cost model, and how iteration counts, salts, and parallelism parameters interact. cryptography · intermediate
- Mar 2, 2026 ARPANET IMPs and the 1822 Host Interface How the Interface Message Processor kept switching separate from host software, what the 32-bit leader and the RFNM handshake enforced, and why one message in flight per link was enough. computing history · foundational
- Mar 2, 2026 Complying With Source Obligations When Shipping Binaries What counts as conveying a copy, how corresponding source is defined for a compiled artifact including its build scripts, and how a build can archive the exact sources and licenses that a shipped binary implies. computing history · advanced
- Mar 1, 2026 Dependence Analysis and Polyhedral Loop Transformations Deciding whether two iterations touch the same memory requires a dependence test, and the polyhedral model turns those tests into an integer linear program whose solution drives tiling, skewing, and fusion. compilers · advanced
-
February
Feb 28, 2026 Chunked Transfer and Retransmission in Firmware Delivery How an image crosses a slow or unreliable link in numbered chunks, why the window size is bounded by the receiver buffer, and where the retry logic belongs. embedded systems · intermediate - Feb 28, 2026 Front-End Throughput and the Fetch Bandwidth Ceiling Why a wide out-of-order back end can still run narrow, how instruction cache line boundaries, prediction, and decode width bound the supply, and what designs do about it. computer architecture · advanced
- Feb 28, 2026 The Three-Level Indirection Behind a Unix File Descriptor How a small integer reaches an inode through a per-process table and a shared open file description, and which operation copies which level. computing history · foundational
- Feb 27, 2026 Decoupled Weight Decay and Adaptive Scaling Why adding a shrinkage term to the gradient is not the same as shrinking the parameter, how the adaptive denominator changes the effective decay per coordinate, and what the decoupled update fixes. deep learning · intermediate
- Feb 27, 2026 Delegating Provisioning Without Delegating the Account How a self-service pipeline obtains cloud credentials through workload identity federation, what the trust policy must pin, and how the blast radius stays bounded. devops · intermediate
- Feb 27, 2026 Inclusion Dependencies and the Undecidability That Follows Them How inclusion dependencies generalize foreign keys across arbitrary attribute sets, why their implication problem needs infinite chase sequences, and what breaks when they are combined with functional dependencies. databases · advanced
- Feb 27, 2026 Maintainer Authority and the Fork as an Exit Mechanism How merge rights, review conventions and ownership files concentrate control of a project that no license grants anyone, and why the license makes forking always possible while the trademarks and distribution channels make it expensive. computing history · intermediate
- Feb 27, 2026 Memory SSA: Giving Loads and Stores Def-Use Chains How aliasing prevents ordinary SSA from naming memory locations, what the memory-phi construction buys for store-to-load forwarding, and why the result must be abandoned rather than verified. compilers · intermediate
- Feb 27, 2026 Merkle Tree Anti-Entropy: Finding Divergence Without Comparing Everything How hash trees over key ranges reduce replica comparison from a full data exchange to a walk over the subtrees that actually differ, and what write churn does to that saving. distributed systems · advanced
- Feb 27, 2026 Placement, Routing, and Congestion in the Logic Array How the placer decides where each cell goes, how the router allocates wire segments, and why a design can fail to route while the array looks half empty. hardware engineering · advanced
- Feb 27, 2026 Readahead Policy and the Read Sizes the Page Cache Actually Sees How the kernel detects sequential access, how far ahead it reads, and why a reader that is fed by readahead measures the cache rather than the storage device. performance engineering · foundational
- Feb 27, 2026 The IPv4 Header Fields That Forwarding Rewrites Which of the twenty header bytes a router must read, which it decrements or recomputes in place, and where the header checksum stops protecting anything. networking · foundational
- Feb 26, 2026 Advisory Ranges, Reachability, and Deciding a Vulnerability Does Not Matter How advisory databases express which versions are affected, why a version range in an advisory is not the same claim as an exploitable dependency, and what evidence supports suppressing a finding. software engineering · advanced
- Feb 26, 2026 Crawl Order as Resource Allocation Under a Fixed Budget How to decide which of the ten million known URLs to fetch first, why importance and freshness compete for the same request, and what ordering rules can and cannot promise. information retrieval · advanced
- Feb 26, 2026 Open-Drain Signalling and Arbitration on a Shared Two-Wire Bus How pull-up resistors and open-drain drivers turn two wires into a wired-AND, and why that makes simultaneous transmission by two masters harmless rather than destructive. embedded systems · foundational
- Feb 26, 2026 Quasiquotation, Unquotation, and Nesting Depth How quasiquote builds template structures with holes, why unquote must match the right quasiquote level, and how the level counter decides which parts of a nested template are evaluated. programming languages · foundational
- Feb 26, 2026 Replica Packing and Topology Constraints Tensor parallelism turns a model into a group of devices that must be co-located and upgraded together. That group, not the individual replica, is the unit a scheduler can place. inference systems · advanced
- Feb 25, 2026 Branch by Abstraction and the Cost of Two Live Paths Replacing a widely used component without a long-lived branch means running both implementations behind one interface. The interface, not the code, is what has to be designed. software engineering · intermediate
- Feb 25, 2026 Depthwise and Grouped Convolutions and the Cost per Channel How splitting channels into groups changes the parameter count, the arithmetic intensity, and the access pattern, and why a cheaper layer is often the slower one. deep learning · intermediate
- Feb 25, 2026 Early Console Output Before Drivers Exist How a kernel prints messages before it has a driver for any display or serial device, why the framebuffer left by firmware is the usual answer, and what early output costs when it is a polling loop. operating systems · intermediate
- Feb 25, 2026 Heterogeneous Cores and the Area-Performance Frontier Why a large core and a small core can be combined to beat either alone, how area efficiency curves determine the mix, and what thread migration costs. computer architecture · advanced
- Feb 25, 2026 The Counting Argument for Circuit Size Lower Bounds Why almost every Boolean function on n bits needs about 2^n/n gates, how Lupanov matched that bound from above, and why the argument cannot name a single hard function. computation theory · foundational
- Feb 24, 2026 Differential Pairs and the Cost of Asymmetry How intra-pair skew converts differential signal into common mode, how to derive a length-matching tolerance from a skew budget, and why the two modes propagate at different speeds. hardware engineering · advanced
- Feb 24, 2026 Identity in SBOMs: PURLs, CPEs, and Why Names Do Not Join An SBOM is only as useful as its keys. Component identity schemes disagree about what a component is, and vulnerability matching fails where they disagree. security · foundational
- Feb 24, 2026 Server-Side Request Forgery and the Address the Server Can Reach Why filtering a user-supplied URL is a parsing problem with a resolution step attached, and where DNS, redirects, and IPv6 forms defeat the check. security · advanced
- Feb 24, 2026 Sort-Last Compositing and the Depth Order Across Ranks How independently rendered partial images are merged into one correct image, why binary-tree compositing beats direct all-to-all, and where blending order and depth precision break the result. scientific computing · advanced
- Feb 24, 2026 Trust Policies, External IDs, and the Confused Deputy Why a trust policy naming a principal is not enough when that principal acts for many customers, and how a shared secret in the assumption request closes the gap. cloud infrastructure · intermediate
- Feb 23, 2026 Copy-Up, Whiteouts and Rename in Overlay Roots What happens on the first write to a file from a lower layer, how deletions are represented without deleting, and which POSIX behaviours overlayfs cannot preserve. virtualization · foundational
- Feb 23, 2026 Finite Differences as a Mechanical Computation Method How a polynomial table is produced by addition alone, why mechanical engines avoided multiplication, and what the method costs in column count and error propagation. computing history · foundational