Complete archive
Archive
3,240 articles, newest first · page 7 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 21, 2026 Autoscaling Signals for Token Servers CPU utilization and request rate both mislead when capacity is pinned by KV cache and iteration time. Queue depth in tokens, cache occupancy, and time-to-first-token measure what matters. inference systems · advanced - Jul 21, 2026 Compensated Summation and How Summation Order Bounds Error The worst-case error of a naive sum grows with the number of terms, pairwise reduction turns that into a logarithm, and compensation removes the growth at the cost of a serial dependency. scientific computing · intermediate
- Jul 21, 2026 Counting Distinct Elements with HyperLogLog Registers How a fixed array of small registers estimates cardinality to within about one percent, why the estimator uses a harmonic mean, and how register-wise maximum makes sketches mergeable. algorithms · foundational
- Jul 21, 2026 Decomposing End-to-End Latency into Waiting and Serving How to split a request's elapsed time into the intervals where it was queued, in flight, or actually being executed, and why the sum of stage timers usually exceeds the total. performance engineering · intermediate
- Jul 21, 2026 Gradient Boosting as Gradient Descent in Function Space Each boosting round fits a small tree to the negative gradient of the loss at the current predictions, which makes the algorithm a steepest-descent step whose direction comes from a restricted model class. machine learning · intermediate
- Jul 21, 2026 Hiding Subtrees Without Breaking Focus or the Tree display none, visibility hidden, aria-hidden, and the hidden attribute remove content from different layers. Choosing wrong leaves focusable nodes inside invisible subtrees or visible text absent from the tree. accessibility · intermediate
- Jul 21, 2026 Kernel Logging: The Ring Buffer Behind printk Why kernel messages are written to a fixed circular buffer instead of a file, how records are framed, and what happens when the console cannot keep up with the producer. operating systems · foundational
- Jul 21, 2026 Linear Probing and Fine-Tuning as Different Measurements A frozen-feature linear probe and full fine-tuning answer different questions about a pretrained encoder, and the gap between their results is itself the informative quantity. deep learning · intermediate
- Jul 21, 2026 Vendored Source Trees and Offline Artifact Mirrors How copying dependencies into the repository changes the resolution problem, what it costs in update latency and duplication, and how mirrors extend the same idea to binary artifacts. language runtimes · intermediate
- Jul 20, 2026 Consistent Hashing and What Changes When a Node Joins Why modulo placement reshuffles almost every key on a membership change, how a hash ring limits the movement, and where the ring still concentrates load. filesystems · foundational
- Jul 20, 2026 Stack Machines and Register Machines as Bytecode Targets Why bytecode formats choose implicit stack operands or named registers, and what that choice costs in encoding width, instruction count, and verifier complexity. language runtimes · foundational
- Jul 20, 2026 The Harmonic Bound for Greedy Set Cover How cost-per-new-element selection yields an H(n) approximation, why that bound is tight, and what the frequency parameter changes. algorithms · intermediate
- Jul 19, 2026 Channel Binding: Tying an Authenticated Session to Its Transport How a protocol proves that the credential exchange it just performed happened inside this specific TLS connection, and why an unbound exchange is open to a relay in the middle. cryptography · intermediate
- Jul 19, 2026 Pre-release Channels and Promotion in Package Registries How candidate builds are published under pre-release identifiers, how dist-tags and channels make the same version resolve differently for different consumers, and why promotion should never rebuild. devops · intermediate
- Jul 19, 2026 Tail Sampling and the Cost of the Decision Window How a collector groups spans by trace identifier before deciding, why the wait is bounded, and what happens when spans of one trace land on different collectors. observability · intermediate
- Jul 19, 2026 The Dependency Graph Behind an Apply: Ordering Edges, Cycles, and Partial Failure How a configuration tool derives execution order from resource references, why the graph is not the file, and what a failed node leaves behind for the next run. devops · foundational
- Jul 18, 2026 Dual-Bank Slots and How a Bootloader Picks One Why two firmware slots turn an in-place overwrite into a recoverable operation, how the boot decision is made from metadata, and what the doubling of flash costs. embedded systems · foundational
- Jul 18, 2026 The Microtask Checkpoint and How Promise Jobs Actually Run The mechanics behind promise callbacks: when the job queue drains, how await lowers to a reaction, and why a thenable resolution costs extra turns. web platform · foundational
- Jul 17, 2026 Compiler Reordering and the Contract It Must Not Break Why an optimiser may sink an atomic load past a store only in certain cases, where the as-if rule stops, and how data races turn a performance model into undefined behaviour. computer architecture · advanced
- Jul 17, 2026 How Many Requests a Canary Gate Needs Before Its Verdict Means Anything The sample-size arithmetic behind canary health checks, why rare failures and tail latencies need orders of magnitude more traffic, and how sequential testing changes the threshold. distributed systems · foundational
- Jul 17, 2026 Quantile Summaries: Greenwald-Khanna Bounds and the KLL Compactor How a deterministic summary tracks ranks within a guaranteed error using tuple invariants, and how randomised compaction reaches constant space per item with a smaller constant. algorithms · advanced
- Jul 16, 2026 Denoising Score Matching and the Noise-Prediction Objective How regressing on the noise that was added to a sample yields an estimate of the data score, and why the equivalence holds without any normalising constant. deep learning · intermediate
- Jul 16, 2026 OpenCL Objects, Contexts, and Runtime Compilation The platform-to-queue object graph in OpenCL, what a program build actually produces, and how vendor portability breaks at kernel compile time rather than at run time. gpu computing · foundational
- Jul 16, 2026 SWIM Ping-Request Probes and Why Suspicion Beats Immediate Declaration How a node delegates a probe to a third party before declaring a peer dead, and how incarnation numbers let a wrongly suspected node refute the claim without a restart. distributed systems · foundational
- Jul 16, 2026 The Places Parameter Binding Cannot Reach Identifiers, sort direction, operators, and collation are resolved before execution, so binding cannot protect them; the designs that survive are structural. security · advanced
- Jul 15, 2026 Footprint Under a Container Limit: Reclaim, Working Set, and the OOM Decision How a memory cgroup accounts page cache and anonymous memory, why a process at its limit keeps running while a slightly larger one is killed, and how to read the counters that separate reclaimable from unreclaimable. memory systems · advanced
- Jul 15, 2026 Single-Pass Prefix Scan with Decoupled Look-Back How a scan produces every prefix in one launch without a chain of kernels, what each block publishes and waits for, and why the algorithm stays linear in total work. gpu computing · intermediate
- Jul 15, 2026 Trapezoidal Maps and Randomized Point Location How a planar subdivision becomes a DAG of trapezoids that answers containment queries in expected O(log n), and why the search structure is a second, separate object. algorithms · advanced
- Jul 14, 2026 Crash-Consistent and Application-Consistent Backups What a point-in-time image really contains, why journal replay only repairs the filesystem, and how to quiesce a running service without stopping it. devops · intermediate
- Jul 14, 2026 Static Timing Analysis: Slack, Corners, and Uncertainty How a timing graph is built from the netlist, what setup and hold slack mean at the two ends of a path, and why the report is only as trustworthy as its corner and derate assumptions. hardware engineering · intermediate
- Jul 13, 2026 Anatomy of a Runbook Step Why a runbook step needs a precondition, a bounded action, and a verification that proves the system changed, and how steps fail when any of the three is missing. devops · intermediate
- Jul 13, 2026 Head-of-Line Blocking and the Transport Gap QUIC Was Built to Fill Why one lost TCP segment stalls every multiplexed request on a connection, and which parts of that coupling a UDP-based transport can actually remove. internet protocols · foundational
- Jul 13, 2026 How srcset and sizes Select an Image Resource Width and density descriptors describe the candidates, the sizes list converts layout into a pixel width, and the choice among candidates belongs partly to the browser. web platform · advanced
- Jul 13, 2026 Self-Contained Access Tokens and the Cost of Local Validation What a resource server gains and loses when it validates a signed token locally instead of asking the issuer, and where clock skew and key caching change the answer. internet protocols · intermediate
- Jul 13, 2026 Structural Hazards and the Cost of Duplicated Resources When two instructions in flight want the same hardware in the same cycle, and how port replication, banking, and arbitration each buy the conflict away at a different price. computer architecture · foundational
- Jul 12, 2026 Happens-Before, Data Races, and the Memory Model Contract What a memory model promises about reordering, why a data race is undefined rather than merely surprising, and how release and acquire pairs carry a happens-before edge. programming languages · intermediate
- Jul 12, 2026 Macro Hygiene and Identifier Capture How macro expansion causes identifiers to bind in the wrong scope, how gensyms and syntax objects prevent it, and what hygiene costs in equality checks and in generated names. programming languages · foundational
- Jul 12, 2026 Why Learning With Errors Is Believed Hard in the Worst Case How finding a close lattice point relates to recovering a secret from noisy linear equations, and why the reduction direction makes lattice schemes resistant to the structural attacks that break structured problems. cryptography · foundational
- Jul 11, 2026 Correlating Logs Across Devices When Clocks Disagree How clock offset and resolution error bound the accuracy of a merged timeline, and how to order events from independent devices without trusting their timestamps. networking · intermediate
- Jul 11, 2026 Cross-Correlation and Convolution in the Forward Pass What the sliding dot product computes, why deep learning libraries conjugate the kernel index, and how zero padding and output size arithmetic follow from the index bounds. deep learning · foundational
- Jul 10, 2026 Concurrent Mutations and Versioned Session Records Why whole-record writes lose updates when a browser issues requests in parallel, and how compare-and-set, fencing tokens, and delta operations keep the record coherent. backend systems · advanced
- Jul 10, 2026 Double Free and the Integrity of Free Lists What the allocator does with a second release of the same block, why the list structure makes it dangerous, and how per-thread caches and consistency checks contain it. memory systems · intermediate
- Jul 10, 2026 Multi-Pattern Matching in Network Intrusion Detection How signature engines match thousands of byte patterns against a reassembled stream with one pass, why normalisation decides what the engine actually sees, and where matching still fails. security · intermediate
- Jul 10, 2026 Rejection Sampling and the Price of the Envelope The acceptance rate of a rejection sampler is exactly the reciprocal of its envelope constant, which is why a proposal that looks cheap can make the loop run thousands of trials per variate. scientific computing · foundational
- Jul 10, 2026 Sources of Nondeterminism in Build Output Timestamps, absolute paths, directory iteration order, and parallelism leak into object files and archives. How each is detected by repeated builds and removed at the source. devops · foundational
- Jul 9, 2026 Braille Displays and the Translation Layer How a refreshable braille display turns screen text into dot patterns through character encoding, and why contracted braille requires a separate translation step. accessibility · intermediate
- Jul 9, 2026 Cache Behaviour and Node Layout in Disjoint-Set Arrays Why a find is a dependent-load chain, how index width and array splitting change the number of cache lines touched, and what key remapping costs before the first union. data structures · intermediate
- Jul 9, 2026 How a Table Format Replaces Directory Listing with a Metadata Tree Why a lakehouse table is defined by a chain of metadata files rather than by the contents of a prefix, and what each level of that chain costs a reader to open. data engineering · foundational
- Jul 9, 2026 Return-to-libc and the Argument Staging Problem Reusing an existing function needs its arguments placed where the calling convention expects them, and the stack arithmetic that makes this possible also limits which functions a chain can call. security · intermediate
- Jul 8, 2026 Bellman-Ford, Round Counts, and Negative-Cycle Detection Why |V|-1 passes suffice, what the extra pass detects, how queue-driven label correction changes the cost without changing the answer, and why detection is easier than extracting the cycle. algorithms · foundational
- Jul 8, 2026 Error Summaries and Focus Placement on Failed Submission Where focus goes when a form rejects a submission, why a summary block beats a browser bubble, and how to make the summary navigable. accessibility · intermediate
- Jul 8, 2026 Growable Stacks and Reduction Budgets in Coroutine Runtimes How a runtime gives each coroutine its own stack segment, why segmented and copied stacks differ, and how a preemption counter bounds the work a coroutine can do. programming languages · advanced
- Jul 8, 2026 OpenEXR Scanline and Tiled Layouts with Half-Float Pixels How EXR stores channels in separate planes, what the half type buys over float and where it runs out, and why the tile descriptor changes random-access cost. computer graphics · advanced
- Jul 8, 2026 Wake-Up Latency and Its Energy Cost Why returning from a low-power state costs microseconds and microjoules, how that cost sets a floor on the usable duty cycle, and where the transition sequence loses time. embedded systems · foundational
- Jul 7, 2026 Checksum Strength: What CRC32C and SHA-256 Each Guarantee The detection guarantees a cyclic redundancy check actually provides, the different guarantee a cryptographic hash provides, and the cost of moving from one to the other. filesystems · foundational
- Jul 7, 2026 Shard Routing and Ownership Metadata: The Directory That Must Not Disagree How clients find the shard for a key, what happens when the routing table is stale, and why ownership epochs turn a racy handoff into a detectable error. databases · advanced
- Jul 7, 2026 What fsync Guarantees and What It Costs on Real Devices The ordering and durability contracts of fsync, fdatasync, and sync_file_range, how a device cache flush turns them into round trips, and where the guarantee quietly ends. performance engineering · intermediate
- Jul 6, 2026 Attention as Content-Based Alignment Over Encoder States How a decoder selects among stored states with a learned weight distribution, why that gives a short gradient path to any position, and what the attention weights cannot represent. deep learning · advanced
- Jul 6, 2026 Critical Bits and Unknown-Field Handling How protocols distinguish a field that may be ignored from one that must be understood, and why the default for unknown fields decides whether a protocol can change. internet protocols · foundational
- Jul 6, 2026 Krylov Subspace Iteration and Why GMRES Restarts How a solver builds a subspace from repeated matrix-vector products, why the symmetric case needs three vectors of memory and the general case needs many, and when restarting destroys convergence. scientific computing · intermediate