Complete archive
Archive
3,240 articles, newest first · page 6 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
Aug 6, 2026 Token Positions and Offsets in Analyzer Output How a token stream records where each term occurred, why position increments encode adjacency for phrase and proximity queries, and how offsets survive synonym expansion. information retrieval · foundational - Aug 6, 2026 Trusted Types and the Typing of DOM XSS Sinks How require-trusted-types-for turns string assignment into a checked operation, what a policy must do beyond returning its input, and how the enforcement spreads across a codebase without freezing releases. web platform · advanced
- Aug 5, 2026 Capability References and the Absence of Ambient Authority Why naming a resource by path or file descriptor grants more than the caller needs, and how unforgeable references make authority a property of what a program holds rather than who it claims to be. language runtimes · foundational
- Aug 5, 2026 Content Addressing and What Artifact Hashes Actually Prove The difference between a hash that identifies bytes and a signature that identifies a publisher, how digest verification fails, and why a matching hash is a narrower guarantee than it appears. language runtimes · intermediate
- Aug 5, 2026 Cycles in Module Dependency Graphs and How to Break Them Why a dependency cycle collapses independent modules into one release unit, how strongly connected components expose the real structure, and which refactorings remove a cycle without adding another. software architecture · intermediate
- Aug 5, 2026 Route Table Precedence and the Local Route Why a VPC route table has a local entry that cannot be deleted, how longest-prefix match interacts with static and propagated routes, and how a blackhole entry fails silently. cloud infrastructure · foundational
- Aug 5, 2026 Snapshot to Stream: Establishing a Position Without Losing Writes Why a consistent snapshot and a log start point cannot be taken atomically by an unprivileged client, and the three mechanisms that close the gap. data engineering · foundational
- Aug 5, 2026 The Contract Elements a Function Reference Entry Has to State A signature fixes argument types and little else. Preconditions, ownership, failure modes, and concurrency guarantees are separate obligations that the reference entry has to record explicitly. software engineering · foundational
- Aug 4, 2026 Deriving an RGB-to-XYZ Matrix from Primaries and a White Point The linear algebra behind a colour space definition: why eight numbers — four chromaticities and a white — determine a 3x3 matrix, and how the solve works. computer graphics · intermediate
- Aug 4, 2026 Desugaring Boundaries: Where Surface Syntax Ends How a language defines sugar by translation to a core form, why for-loops and async blocks are specified as rewrites, and what the rewrite leaks into error messages. programming languages · advanced
- Aug 4, 2026 Evolving a Dimensional Model Without Rewriting Its History Which schema changes are additive, which silently change a measure's meaning, and how to refine a grain or retire a column while old and new consumers coexist. data engineering · advanced
- Aug 3, 2026 Definitional and Propositional Equality Why a type checker can only decide equality by computation, what must be proved as a proposition instead, and how equality reflection changes the boundary between the two. computation theory · intermediate
- Aug 3, 2026 UART Framing, Baud Rate Error, and the Overrun That Loses Data How start-bit synchronisation survives clock mismatch, how much baud error a ten-bit frame tolerates, and why the receive FIFO overruns before the interrupt handler runs. embedded systems · foundational
- Aug 2, 2026 Right-Linear Grammars and the Limits of One-Way Derivation Why a grammar whose rules can only consume input left to right generates exactly the regular languages, and what happens to the language when left-linear rules are mixed in. computation theory · foundational
- Aug 1, 2026 Accessible Name Computation How a screen reader derives the single name string for an element from text, labels, aria-labelledby, and fallbacks, and why precedence rules matter. accessibility · foundational
- Aug 1, 2026 Attribute-Based Policy Evaluation and Combining Algorithms How XACML-style policies decide by matching attributes and combining rule effects, why deny-overrides is not the same as first-applicable, and what obligations and indeterminate results cost. security · intermediate
- Aug 1, 2026 Pumping Lemmas, Marked Positions, and the Limits of Counting Arguments Why the pumping lemma is a necessary condition for regularity and never a sufficient one, and how marking positions in the input strengthens the argument for both regular and context-free languages. computation theory · intermediate
- Aug 1, 2026 Ranks, Communicators, and the SPMD Execution Model Why a cluster program is a fixed set of processes with private address spaces, and what the communicator abstraction adds beyond a process index. scientific computing · foundational
- Aug 1, 2026 What a Unified Diff Hunk Actually Encodes How the hunk header, the minus and plus blocks, and the context window are produced, and which parts of a change a line-oriented diff cannot represent at all. software engineering · foundational
-
July
Jul 31, 2026 Monotone Integer Keys: Bucket Queues and Radix Heaps When extracted keys never decrease, an array of buckets beats comparison-based heaps; how circular bucket arrays and radix heaps exploit integer bounds. data structures · advanced - Jul 31, 2026 Position-Independent Code, the PLT, and the GOT Why a shared object cannot know its load address, how the global offset table turns an absolute address into a load-time fixup, and what lazy binding defers. systems programming · advanced
- Jul 30, 2026 Keeping Focus Stable in Virtualized and Reordered Lists Why windowing libraries lose focus when they recycle nodes, how sorting a list breaks a tab stop, and what content-visibility does to the focusability of skipped subtrees. accessibility · advanced
- Jul 29, 2026 In-Process Caches: Retained Heap and the Cost of a Hit What a per-process cache actually retains beyond its values, how object headers and hash-table slots multiply the footprint, and why the garbage collector makes an unbounded local cache a latency risk. backend systems · advanced
- Jul 29, 2026 Leader Leases and Fencing Tokens in Failover Why a demoted leader can still issue writes, how time-based leases bound that window, and why fencing tokens rather than timeouts are what actually protects shared storage. distributed systems · foundational
- Jul 29, 2026 Opaque Handles and Ownership Transfer in C APIs Why handle-based interfaces survive changes that struct-based ones cannot, how borrowing differs from transfer, and what an invalidated handle means to the caller. language runtimes · advanced
- Jul 29, 2026 Rotation Coverage Math and the Handoff Contract How 168 hours of weekly coverage divide across a team, what shift length costs, and what has to cross the boundary at every handoff. devops · foundational
- Jul 29, 2026 Split-Time Feature Subsampling in Random Forests Restricting the candidate columns at every split lowers the correlation between trees, and the strength-correlation trade explains why the default is neither one feature nor all of them. machine learning · intermediate
- Jul 29, 2026 Supervising Syscalls with Seccomp User Notification How a filter can suspend a syscall and hand the decision to another process, what the notification structure carries, and why descriptor injection avoids the race that memory inspection cannot. virtualization · intermediate
- Jul 29, 2026 Thread Stacks, Guard Pages, and Thread-Local Storage How a thread stack is reserved, why a guard page turns overflow into a fault, and how a per-thread block is addressed without a lookup. operating systems · intermediate
- Jul 28, 2026 Mounting: From Device Node to a Live Superblock The sequence a filesystem driver follows when it is handed a block device, the checks that must pass before the volume becomes writable, and what a failed mount must unwind. filesystems · advanced
- Jul 28, 2026 Row Polymorphism for Extensible Records How a row variable records the fields a function does not touch, why lack constraints are needed for extension, and what the algorithm costs. programming languages · intermediate
- Jul 28, 2026 STT_GNU_IFUNC: Choosing an Implementation at Load Time How a symbol can name a function that returns the address to call, the constraints the resolver runs under, and why the technique trades startup determinism for dispatch without indirection. compilers · advanced
- Jul 27, 2026 Concurrency Per Environment and the Unit a Function Platform Scales Why serverless platforms scale environments rather than requests, how per-environment concurrency changes the arithmetic, and where the queue lives when the limit is reached. cloud infrastructure · intermediate
- Jul 27, 2026 Decomposing the Failover Time Budget How detection delay, decision quorum, promotion, and traffic redirection add up into a recovery time, and which of the four terms an operator can actually shorten. cloud infrastructure · foundational
- Jul 27, 2026 Gap Amplification and Why Some Ratios Cannot Be Improved How the PCP theorem turns a gap in a constraint system into an inapproximability result, and what that means for the approximation ratios of the algorithms it bounds. algorithms · advanced
- Jul 27, 2026 Resolution as Constraint Search: Why Dependency Solving Is NP-Hard How a resolver chooses versions for a whole graph at once, why the general problem resists polynomial algorithms, and which practical strategies keep real graphs solvable. software engineering · foundational
- Jul 27, 2026 Shared Build Cache Design: Action Keys, Content Store, and Eviction Why a build cache is two stores with different lifetimes, how write-once content addressing enables deduplication, and which eviction and failure policies keep a cache outage harmless. devops · advanced
- Jul 27, 2026 SR-IOV Virtual Functions and Static Partitioning of GPU Engines A single PCI function becomes many by replicating the parts that carry identity, and the GPU functions that cannot be replicated become the hard limits on how finely a card can be split. gpu computing · foundational
- Jul 27, 2026 Two-Phase Commit and the Coordinator Decision Record Why a distributed commit needs a durable, single-source decision, what each participant promises when it votes yes, and how the coordinator log resolves a crash in the middle of the protocol. distributed systems · foundational
- Jul 26, 2026 Sparse Merkle Trees and Proofs of Non-Membership How a tree whose leaves are addressed by their own hashes proves absence, and what the default-hash rule, index lookup, and proof size cost at real key widths. cryptography · advanced
- Jul 25, 2026 Clock Domain Crossing: Synchronizers, Handshakes, and False Paths Why a flip-flop sampling an unrelated clock can go metastable, how a two-flop synchronizer bounds the failure rate, and how data buses cross domains without tearing. hardware engineering · intermediate
- Jul 25, 2026 Load Balancing Policy and Effective Capacity How assignment policy, connection reuse, and request-class knowledge change the throughput a pool can sustain, and why a policy tuned for latency can reduce total capacity. performance engineering · advanced
- Jul 24, 2026 Atomic Reference Counts and the Cycle They Cannot Collect The instruction cost of shared ownership, why the count must be atomic, and the reachability problem that makes a pure reference-counting collector leak. systems programming · intermediate
- Jul 24, 2026 Bit-Parallel Approximate Matching with Packed DP Rows How a whole column of the edit-distance table fits into one machine word, what the bit-vector recurrence computes, and where the 64-character pattern limit forces blocking. algorithms · advanced
- Jul 24, 2026 How Ranges Survive Mutation: Boundary Points and Live Updates A range is two boundary points that the DOM rewrites on every insertion and removal, and the adjustment rules explain both editing behaviour and the per-mutation cost of keeping ranges alive. web platform · advanced
- Jul 24, 2026 Litmus Tests and How Allowed Outcomes Are Decided How a few lines of concurrent code pin down a memory model, how tools enumerate the executions, and why "never observed" is weaker than "forbidden". computer architecture · intermediate
- Jul 24, 2026 Model Registries and Promotion Gates Between Training and Traffic What a registry records about an artifact, how staging transitions are gated on evidence, and why the serving path must resolve versions rather than names. machine learning · advanced
- Jul 24, 2026 Screen-Space Binning in Tiled Rasterizers Sorting primitives into per-tile bins before shading gives locality of depth and colour access, makes deferred shading affordable, and costs a variable amount of memory per tile. computer graphics · advanced
- Jul 24, 2026 The Roofline Bound and Arithmetic Intensity How the ratio of arithmetic to bytes moved places a kernel under either a compute ceiling or a bandwidth ceiling, and why the ridge point differs between devices. gpu computing · foundational
- Jul 23, 2026 Fair Lock Queues from Sequential Nodes How a ticket built from a sequential child name turns lock contention into a queue, why each waiter watches only its predecessor, and what a herd costs by comparison. distributed systems · intermediate
- Jul 23, 2026 Placement Constraints and the Anatomy of an Unschedulable Workload How taints, tolerations, affinity, and topology spread interact so that a workload can be legal on every node individually and still fit nowhere, and how preemption resolves it. virtualization · intermediate
- Jul 23, 2026 Prototype Chain Guards and Validity Cells Why a compiled access through a prototype is invalidated by an assignment to the prototype rather than by a failed layout check, and how a one-word cell makes that invalidation cheap. language runtimes · intermediate
- Jul 23, 2026 Ring Compression: Deprivileging a Guest Kernel Without Losing Its Own Protection How a hypervisor moves a guest kernel down the x86 privilege ladder, why the choice between ring 1 and ring 3 changes what the guest can enforce against its own processes, and which instructions leak the difference. virtualization · foundational
- Jul 23, 2026 Virtualizing the Local APIC: Access Pages, Virtual Interrupt Delivery, and Posted Interrupts Why every interrupt acknowledgement used to cost an exit, how hardware removed the exit for the common case, and what a posted interrupt descriptor does between the device and the guest. virtualization · intermediate
- Jul 23, 2026 What Sanitizers and Miri Cannot Prove Instrumentation detects violations on the paths an execution took, and an interpreter sees only the code it can run, so both produce evidence of bugs rather than evidence of their absence. systems programming · advanced
- Jul 23, 2026 What TLS 1.3 Removed: Renegotiation, Compression, and Static RSA The features dropped between 1.2 and 1.3, the attacks that motivated each removal, and the compatibility cost that came with a smaller protocol. internet protocols · advanced
- Jul 23, 2026 Winding Order, Backface Culling, and the Two-Sided Lighting Problem How the signed area of a projected triangle identifies a front face, why culling is a rasterizer-level rejection rather than a vertex operation, and what happens to normal direction when a face is seen from behind. gpu computing · intermediate
- Jul 22, 2026 Hermetic Actions and Undeclared Inputs An action is hermetic when its output depends only on inputs the graph names. The channels through which that property leaks, the sandboxes that close them, and the cost of closing them. developer tools · intermediate
- Jul 22, 2026 Interrupt Controllers from the 8259A to Message-Signalled Interrupts Why interrupts moved from shared wires and acknowledge cycles to memory writes, and what the older controllers still constrain in a modern machine. operating systems · foundational
- Jul 22, 2026 Version Codes, Monotonic Ordering, and Downgrade Refusal Why the installer compares an integer rather than a version string, how a version code that wraps or repeats poisons an update path, and where platform policies override monotonicity. mobile computing · intermediate