Complete archive

Archive

3,240 articles, newest first · page 9 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
Jun 20, 2026 Energy-Optimal Operating Points and the Shape of DVFS Why the lowest voltage a circuit can run at is not the most efficient one, how frequency and voltage must move together, and where the energy minimum sits for a real workload. hardware engineering · advanced
Jun 20, 2026 Isolation Levels and the Anomalies They Were Supposed to Prevent Why the SQL standard isolation levels are defined by the anomalies they should exclude, why that definition is incomplete, and what Critic and ARIES work revealed about writes that are visible before they are durable. computing history · foundational
Jun 19, 2026 Conformance Evidence and Defect Triage How to assemble a defensible accessibility claim: sampling by template, recording scope and exceptions, ranking defects by user impact, and keeping the evidence current. accessibility · advanced
Jun 19, 2026 Flood and Learn Versus a BGP EVPN Control Plane How a tunnel endpoint discovers the remote endpoint for a MAC address by flooding and learning from the reply, what that costs at scale, and how a routing protocol replaces the guesswork. networking · intermediate
Jun 19, 2026 Intel HEX, Motorola SREC, and What a Programmer Actually Consumes The record structure of the two textual image formats, how each encodes load addresses and detects corruption, and why a raw binary loses the information a programmer needs. embedded systems · intermediate
Jun 18, 2026 How a Feature Becomes a Leak Leakage defined as a dependency between the training representation and the evaluation labels, the three mechanisms that create it, and why it inflates validation without touching training error. machine learning · foundational
Jun 18, 2026 Iteration-Level Batching and the Cost of a Fixed Batch Why a batch fixed at admission time strands accelerator capacity, and how re-deciding the batch at every decode step changes the cost of a token. inference systems · foundational
Jun 18, 2026 Phase Separation and the Ordering of Compilation Stages Why a macro must be defined before it is used, how phase levels propagate through module dependencies, and what transitive phase shifting costs in compilation work. programming languages · advanced
Jun 18, 2026 Simulating an NFA Without Determinizing It: State Sets, Epsilon Closure, and Bitsets How a nondeterministic automaton runs on a single pass by carrying a set of live states, why the closure step dominates the cost, and how bitsets make it cheap. computation theory · foundational
Jun 17, 2026 Capacity Failure Modes Under Peak Load The specific mechanisms that turn a load peak into an outage: queue overload, resource leaks under retry, cold cache amplification, and the asymmetry between degradation and recovery. performance engineering · advanced
Jun 17, 2026 Error Budgets as a Release Gate: The Arithmetic Behind the Freeze Converting a service level objective into a measured allowance of failure, normalising it with burn rate, alerting on two windows at once, and the places where the arithmetic stops matching user experience. software engineering · advanced
Jun 17, 2026 Hash and Range Partitioning: Choosing What the Shard Key Preserves Why range partitioning keeps ordered scans and concentrates writes, why hashing spreads load and destroys locality, and how consistent hashing changes only the movement cost. databases · intermediate
Jun 17, 2026 The traceparent Header: Field Widths and Version Negotiation The exact byte layout of the W3C traceparent header, why its fields are fixed width, what the flags byte means, and how a version-00 parser must treat unknown versions. observability · foundational
Jun 17, 2026 Transaction Lifetime and Durability in IndexedDB Why an IndexedDB transaction commits without being asked, which callbacks keep it alive, how a failed request aborts the whole scope, and what the durability hint actually guarantees. web platform · intermediate
Jun 17, 2026 Work Stealing and the Cost of Task Granularity How per-worker deques with stealing keep locality for producers and absorb imbalance, why the victim is chosen at the tail, and where the stealing overhead overtakes the gain. performance engineering · intermediate
Jun 16, 2026 Containment and Container Queries What each containment type isolates, why size containment is required for query containers, and how query units and content-visibility change the sizing of a subtree. web platform · advanced
Jun 16, 2026 Cost-Complexity Pruning and the Weakest-Link Sequence How a maximal tree is collapsed into a nested family of subtrees indexed by one penalty parameter, and why the sequence makes cross-validation cheap. machine learning · foundational
Jun 16, 2026 Filtering Normal Maps Without Flattening the Detail Why averaging encoded normals is not the same as averaging the surfaces they describe, what renormalization and variance preservation each recover, and how to choose between them. computer graphics · advanced
Jun 16, 2026 Fitts Law as a Target-Size Constraint: Throughput, Index of Difficulty, and Hit Area How the time to acquire a target scales with distance and width, why width beats distance in interface layout, and what the model does not predict about real pointing. accessibility · intermediate
Jun 16, 2026 From the First Kernel Thread to PID 1 How the kernel creates its initial task, what changes when that task returns to user mode, and why the first user-space process must be a single-threaded, privileged program that never exits. operating systems · intermediate
Jun 16, 2026 KV Cache Quantization and Per-Token Scale Placement Why the key and value caches need different quantization axes, how per-token scales interact with the attention kernel, and what happens to the softmax when keys lose precision. inference systems · advanced
Jun 15, 2026 Jacobian-Vector and Vector-Jacobian Products in Autodiff Why differentiation machinery never materializes a Jacobian, the cost rule that decides whether to sweep forward or backward, and how the same primitives produce exact Hessian-vector products. deep learning · advanced
Jun 15, 2026 Mailbox Semantics and Ordering Guarantees in the Actor Model Why an actor mailbox orders messages only per sender pair, what selective receive costs in queue scans, and how an unbounded mailbox becomes the model's characteristic failure. programming languages · foundational
Jun 15, 2026 Span Attribution: Making Generated Claims Point at Real Text How offsets survive chunking, encoding, and decoding; what a citation can and cannot prove; and why quote verification is a string operation rather than a judgement. inference systems · advanced
Jun 15, 2026 SPF Evaluation and Its Ten-Lookup Budget How a receiver matches a sending IP against a domain policy written in TXT records, why the recursion limit exists, and what each result value actually permits. internet protocols · intermediate
Jun 15, 2026 Tolerant Readers, Unknown Fields, and the Cost of Strict Decoding How clients should handle members and enum values they do not recognise, why strict decoding turns every addition into a breaking change, and where tolerance turns into silent corruption. software architecture · intermediate
Jun 15, 2026 Virtualizing Accelerators Without Hardware Partitioning How software emulation, mediated passthrough, and API remoting differ, what each costs in exits, and why a device with a single register window resists sharing. computer architecture · advanced
Jun 15, 2026 Write-Ahead Log Record Ordering and the Force-at-Commit Boundary Why a log record must reach stable storage before the page it describes, what LSN comparison guarantees during recovery, and where group commit fits in the sequence. databases · foundational
Jun 14, 2026 Context-Sensitive Rules and Why Non-Contracting Rewriting Is Decidable A rule may rewrite a symbol in the context of its neighbours as long as it never shortens the string, and that single restriction turns an unbounded search into a finite one. computation theory · advanced
Jun 14, 2026 Incremental Reparsing After an Edit How an editor reuses the parse tree around a changed range, why error recovery nodes make reuse unsafe, and what the invalidation rules must guarantee. compilers · advanced
Jun 14, 2026 SQL Injection as a Failure of the Tokenization Boundary Why a database cannot distinguish a value from a statement once they are concatenated into one string, and how separate parameter transport restores the boundary. security · foundational
Jun 13, 2026 Middleware Composition and Why Order Changes Behaviour What a middleware chain actually is at runtime, which orderings the mechanism forces, and how buffering middleware breaks streaming responses. backend systems · intermediate
Jun 12, 2026 Memory-Mapped Registers and the Ordering Rules Behind a Store How a device BAR becomes an address the core can load and store, why a posted write is not a completed write, and what a read-back actually guarantees. computer architecture · foundational
Jun 12, 2026 Principal Component Analysis Through the Singular Value Decomposition Maximizing projected variance, minimizing reconstruction error, and decorrelating features all select the same subspace, and the SVD computes it without ever forming the covariance matrix. machine learning · intermediate
Jun 11, 2026 Choosing an I/O Scheduler and Setting Queue Depth What an elevator can still do on a device with no seek cost, the difference between the none, mq-deadline, and Kyber schedulers, and how queue depth controls latency. filesystems · intermediate
Jun 11, 2026 Coordinated Omission in Latency Measurement Why measuring response time only for completed requests hides the worst delays, how the bias arises, and which measurement schemes avoid it without inventing numbers. backend systems · advanced
Jun 11, 2026 Credit-Based Flow Control and Consumer Prefetch Limits A broker that pushes messages needs permission to send, and the counter that grants it decides both memory consumption and how evenly work lands across consumers. backend systems · intermediate
Jun 11, 2026 Ed25519 Cofactors, Canonical Encoding, and Strict Verification A twisted Edwards curve with a small cofactor and a single verification equation leaves several checks outside the signature standard, and different libraries have disagreed about them. cryptography · intermediate
Jun 11, 2026 Immutable Sequences and Structural Sharing in Radix-Balanced Vectors How a fixed branching factor turns an array into a shallow tree whose updates copy one path, and what the size table and tail slot buy the index. data structures · advanced
Jun 11, 2026 Orphan Keys: Checking Referential Integrity Without Foreign Keys Warehouses rarely enforce foreign keys, so referential integrity becomes a scheduled anti-join; its cost, its two directions, and the time dimension that makes it ambiguous. data engineering · advanced
Jun 11, 2026 Static Archives and Link Order: Why a Library Must Come After Its User How an ar archive is laid out and searched, why a single left-to-right pass over libraries resolves some references and not others, and what group and repeated search do about it. compilers · foundational
Jun 10, 2026 Boyce-Codd Normal Form and the Cost of Losing a Dependency Why BCNF decomposition can make a functional dependency unverifiable without a join, how 3NF avoids that, and when the extra anomaly is the better trade. databases · intermediate
Jun 10, 2026 Choosing Between SCD Types 1, 2, 3 and 6 The cost of overwriting an attribute, the cost of versioning it, and the cost of keeping a previous value in a column, set against the questions each type can and cannot answer. data engineering · intermediate
Jun 10, 2026 Costing a Parallel Plan: Workers, Gather, and the Serial Fraction Why dividing a plan cost by the number of workers overestimates the gain, how the planner prices worker startup and row transfer, and when a parallel plan loses to a serial one. databases · advanced
Jun 10, 2026 Designing for Blast Radius in a Single Apply How state boundaries, replacement rules, and apply ordering determine how much infrastructure a failed run can take down, and what can be enforced before the call is made. cloud infrastructure · advanced
Jun 10, 2026 Frame Budget Arithmetic and the Real Deadline for Main Thread Work Why the per-frame budget is smaller than the refresh period, how the pipeline splits it between CPU and GPU, and which stages can run in parallel with which. mobile computing · foundational
Jun 10, 2026 HTTP/2 Stream Multiplexing and Flow Control on the Server How independent streams share one TCP connection, why flow control is owed at two levels, and what per-connection compression state costs a server. backend systems · advanced
Jun 10, 2026 Reliability Block Diagrams and Markov Availability Models Composing availability through series and parallel blocks, translating nines into downtime, and using a small state model where repair and degradation matter more than independence. software architecture · advanced
Jun 10, 2026 Serializable Snapshot Isolation When Reads Span Several Shards How SSI tracks rw-dependencies to detect dangerous structures, why the conflict graph must be shared between shards, and what the read-only optimisation costs once reads are remote. distributed systems · intermediate
Jun 10, 2026 Superinstruction Selection and In-Place Opcode Quickening How interpreters fuse frequent opcode pairs and rewrite instructions after first execution, and why every such rewrite needs an invalidation path. language runtimes · advanced
Jun 10, 2026 What a Neutral Foundation Holds and What It Cannot Change Foundations exist to hold the assets a project cannot own as a group: copyright title, trademarks, funds and release infrastructure; their legal form decides what they can do, and neutrality is a matter of procedure rather than of intent. computing history · intermediate
Jun 9, 2026 Blast Radius and Cell-Based Isolation How failure propagates through shared pools and control planes, how cells bound the damage to a fraction of traffic, and what the routing layer costs in exchange. software architecture · foundational
Jun 9, 2026 d-Ary Heaps and How Branching Factor Changes Cost Trading comparisons per level against levels per sift, why four children often beats two on real hardware, and where the arithmetic stops fitting in a register. data structures · intermediate
Jun 9, 2026 Delta-of-Delta Timestamps and XOR Float Encoding on Disk How a time series block compresses to roughly two bytes per sample using a predictable timestamp pattern and the leading zeros of consecutive floats. observability · advanced
Jun 8, 2026 Adaptive Radix Tree Node Layouts ART keeps fan-out high without paying a 256-way node per prefix: four node widths, a 256-entry indirection table, path compression inside the header, and lazy expansion of leaves. data structures · intermediate
Jun 8, 2026 Chordal Interference Graphs and Optimal Coloring in SSA Form Why the interference graph of an SSA program has no induced cycles longer than three, how a perfect elimination ordering yields a minimum coloring in linear time, and what destroying SSA costs. compilers · advanced
Jun 8, 2026 Header Files as an Interface Contract and the ODR Landmine What the ISO C and C++ translation-unit models formalize, how the one-definition rule fails silently when headers disagree, and why the language committee took decades to admit that separate compilation is not composition. computing history · foundational
Jun 8, 2026 How a Frame Is Produced: Style, Layout, Paint, and Composite The stages a browser runs between a DOM change and a changed pixel, which stages each kind of change can skip, and where the frame budget is actually spent. web platform · foundational
Jun 8, 2026 Segment Liveness Accounting: How the Cleaner Knows What Is Already Dead Maintaining a live-byte count per segment as blocks are superseded, why the count must be exact rather than sampled, and how indirect blocks make the decrement easy to get wrong. filesystems · intermediate
Jun 8, 2026 Web Push: Subscription, Encryption, and Delivery The four parties involved in a push message, how the aes128gcm envelope hides the payload from the push service, and which delivery headers decide whether a message is shown or dropped. web platform · advanced

2026