Complete archive

Archive

3,240 articles, newest first · page 19 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.

2025
Dec 30, 2025 Fleet-Wide Alerting and the Per-Instance Rule Why the aggregation level of an alerting rule decides both what it can detect and how many notifications it produces, and how to choose between per-instance, per-shard, and fleet-wide evaluation. observability · intermediate
Dec 30, 2025 Idempotent Task Boundaries and Atomic Output Publication How a task makes a second execution safe, why writing to a staging location and swapping is cheaper than deduplication, and what the swap cannot protect. data engineering · foundational
Dec 30, 2025 Timer Coalescing and the Deferrable Work Budget How a kernel batches timer expiries, how slack and tolerance let a deadline drift, and why a wakeup that can wait is worth more than one that cannot. mobile computing · foundational
Dec 29, 2025 Clock and Power Gating: Computing the Break-Even Point How gating removes switching power from idle units, what state retention and inrush current cost, and the idle duration at which each form of gating starts to pay. computer architecture · foundational
Dec 29, 2025 Content-Addressed Cache Keys for Incremental Asset Builds Why a timestamp is the wrong invalidation signal, what belongs in a hash that keys an asset build, and how a stale cache entry survives a settings change. computer graphics · advanced
Dec 29, 2025 Counting Bloom Filters and the Price of Supporting Deletion Replacing bits with small saturating counters makes removal possible, but residue, overflow, and spurious decrements each introduce a distinct failure. data structures · foundational
Dec 29, 2025 Enforcing Sandbox Policy at BPF LSM Hooks How an eBPF program attached to a kernel LSM hook can decide a security question with access to kernel objects, and why the hook it chooses determines what it can express. virtualization · advanced
Dec 29, 2025 Fault Injection as a Continuous Regression Test How an experiment becomes a repeatable test case with a pass predicate, why resilience tests fail for environmental reasons far more often than for real regressions, and what a green suite does not prove. devops · advanced
Dec 29, 2025 From Heuristic Hashes to the Random Oracle Model Why hash-based proofs are stated against an idealised function, what a reduction actually guarantees when the real hash is used instead, and where the modelling assumption fails. cryptography · advanced
Dec 27, 2025 Fan-Out and the Amplification of Tail Latency How issuing a request to many backends converts a rare slow response into a common one, the arithmetic behind that amplification, and the structural ways to cap it. backend systems · foundational
Dec 27, 2025 Fat Trees, Toruses, and the Bisection Bandwidth Ceiling How the worst-case cut through a network bounds global traffic, why a torus gives up bisection bandwidth for constant degree, and where each topology fits. scientific computing · intermediate
Dec 27, 2025 Loss Detection Without Retransmitted Packets How QUIC infers loss from packet-number gaps and time thresholds, why frames rather than packets are retransmitted, and how probe timeouts keep a connection from stalling. internet protocols · intermediate
Dec 26, 2025 Diffusion and Branch Numbers in Block Cipher Design How the wide-trail strategy counts active S-boxes across rounds, why a branch number of five bounds a four-round characteristic, and where the bound stops applying. cryptography · intermediate
Dec 26, 2025 Eye Tracking and Gaze-Based Selection How an eye tracker estimates where a user is looking, why gaze alone is a poor pointer, and how dwell and other schemes turn gaze into reliable selection. accessibility · advanced
Dec 25, 2025 Error Returns and the errno Convention Why the kernel signals failure with a negative value in the result register, how the C library turns that into errno, and which failures a caller cannot distinguish. operating systems · foundational
Dec 24, 2025 Inline Validation Timing and When Errors Should Speak How validation on blur, on input, and on submit differ in what they interrupt, how debouncing and politeness control announcement, and why premature feedback degrades entry. accessibility · advanced
Dec 24, 2025 Permission Checks at Open and the Bits That Change Meaning The mode word is consulted once, at open, against the whole path; umask, the sticky bit, setgid inheritance, and default ACLs each bend the rule in a way that surprises the caller. filesystems · advanced
Dec 24, 2025 Safepoints and Stack Maps: Letting a Collector Find Roots Why compiled code must describe its live pointers at specific instruction offsets, how the runtime gets control there, and what polling costs in the hot path. programming languages · intermediate
Dec 23, 2025 Commitment Instruments and Break-Even Utilization What a reserved-capacity or savings-plan discount actually buys, how the hourly commitment becomes a sunk cost, and where the break-even utilization sits relative to list price. cloud infrastructure · intermediate
Dec 23, 2025 Pre-Shared Key Binders and the Cost of Early Data How a binder commits a client to a session ticket before the server has contributed anything, why 0-RTT cannot be replay-protected by the protocol, and what the truncation rules prevent. cryptography · intermediate
Dec 22, 2025 Kernel Fusion and the Cost of a Launch Boundary What a separate kernel launch actually costs in time and traffic, when merging two kernels into one is a net win, and which shapes cannot be fused. gpu computing · advanced
Dec 22, 2025 Paravirtualization and the Hypercall ABI: Trading Transparency for Fewer Traps How a modified guest replaces trapping instructions with explicit calls into the hypervisor, what a hypercall looks like at the instruction level, and why the ABI has to be versioned and discoverable. virtualization · intermediate
Dec 22, 2025 Reproducing Training Runs from Recorded Metadata What a training run must record so that a second execution yields the same weights, and where nondeterminism survives even a perfect record. machine learning · intermediate
Dec 22, 2025 Service Worker Update Semantics and skipWaiting How byte comparison decides whether a new worker installs, what updateViaCache changes about that check, and why calling skipWaiting while old documents are open produces mixed-version clients. web platform · advanced
Dec 22, 2025 What an Automated Accessibility Check Can Decide Which accessibility questions resolve from the serialized DOM and computed style, which require judging meaning, and why an engine cannot tell the difference on its own. accessibility · foundational
Dec 21, 2025 Merkle Trees as a Signature Scheme: One Key, Many One-Time Keys A hash-based signature is a one-time object, and a binary authentication tree is what turns a finite collection of them into a long-lived public key with logarithmic signatures. cryptography · advanced
Dec 21, 2025 Spanning Tree Port States and the Cost of a Blocked Link BPDU exchange elects a root, each bridge picks a least-cost port, and the resulting states determine which ports forward; convergence delays are the price. networking · intermediate
Dec 20, 2025 Header Splitting: When a Value Becomes a Field Boundary How CR and LF terminate header fields on the wire, what modern servers do to reject them, and why the response body and the request line need separate treatment. security · intermediate
Dec 19, 2025 Conflict-Driven Backtracking in Dependency Resolution How a resolver learns from failure instead of retrying every combination, using incompatibilities, unit propagation, and backjumping to the decision that actually caused the conflict. developer tools · intermediate
Dec 19, 2025 Cron Triggers, Misfire Policy, and the Runs That Never Happen Turning a recurrence expression into at-most-one job per period, choosing what to do with slots missed during downtime, and why a schedule that never fires is invisible without an external expectation. backend systems · intermediate
Dec 19, 2025 Neighbour Cache Staleness and Peers That Become Unreachable How ARP and Neighbor Discovery entries age through reachable, stale, and probe states, and why a stale entry keeps sending traffic to an address that has moved. networking · intermediate
Dec 17, 2025 Anisotropic Footprint Filtering Along the Major Axis Why a single mip level cannot represent an elongated pixel footprint, how an anisotropic sampler builds the ellipse, and where the extra taps go. computer graphics · intermediate
Dec 17, 2025 Anomaly Detection on a Bill That Is Mostly Flat Why a fixed threshold catches nothing in a periodic cost series, how to model a baseline from history, and what a change in resource count does to a detector tuned for price. cloud infrastructure · advanced
Dec 17, 2025 Device DMA and the IOMMU Boundary What a device must be given before it can write to host memory, how an IOMMU turns a device address into a machine address, and what that translation costs. computer architecture · intermediate
Dec 17, 2025 Push as a Wakeup Path from APNs to the App Execution Window How a silent notification becomes a bounded execution window, why the push service collapses and throttles deliveries, and what the app can still be trusted to do. mobile computing · intermediate
Dec 17, 2025 Registry Protocols: Blob Uploads, Ranges and Cross-Repository Mounts The HTTP API behind image distribution, including chunked upload sessions, resumable ranges, manifest validation and the mount shortcut that avoids re-uploading shared layers. virtualization · advanced
Dec 16, 2025 Automatic Rollback Controllers and the Ways They Misfire A controller that reverts a deployment on a metric threshold is a feedback loop wrapped around a feedback loop; its failure modes are oscillation, latency in the evidence, and disagreement about what baseline means. inference systems · advanced
Dec 16, 2025 Initiation Interval and the Recurrence That Caps Throughput Why a loop with a circular dependency cannot be pipelined faster than its critical cycle allows, and how resource limits and latency combine into a minimum initiation interval. computer architecture · advanced
Dec 16, 2025 Refinement Types and the SMT Obligations Behind Them How a type is refined with a predicate, why the checker emits verification conditions, and which programs a solver can and cannot decide. programming languages · advanced
Dec 16, 2025 What the Ring Structure Costs: MOD-LWE Versus Plain LWE Why replacing a random matrix with polynomial multiplication shrinks keys and speeds arithmetic, and which cryptographic and cryptanalytic problems that structure introduces in exchange. cryptography · advanced
Dec 15, 2025 Allocator Metadata and the Real Cost of a Small Object What a heap spends on headers, free-list links, alignment padding, and page maps, and how to compute the ratio between bytes requested and bytes the process actually pays for. memory systems · intermediate
Dec 15, 2025 Reproducible Builds and the Sources of Byte-Level Nondeterminism Why two builds of identical source produce different archives, which fields carry the difference, and what verification requires beyond a matching hash. language runtimes · advanced
Dec 13, 2025 pNFS Layouts: Separating the Metadata Path from the Data Path A parallel NFS layout is a grant from the metadata server to read and write directly from storage devices it does not control. The layout type, the layout state, and the recall of a layout determine what the client can do without asking. filesystems · advanced
Dec 13, 2025 Structure Learning and the Limits of Markov Equivalence How independence tests and scoring functions recover a graph from data, why observation alone cannot orient every edge, and what the search has to assume to terminate. machine learning · advanced
Dec 12, 2025 Live Collections, Static Snapshots, and the Cost of Traversal Query results differ in whether they track later mutations, and that difference decides whether iteration is safe and when a query pays for a full subtree walk. web platform · intermediate
Dec 11, 2025 Columnar Layout and the Cost of Reading One Field How storing each field in its own contiguous run changes the bytes a scan touches, why homogeneous columns compress better, and what the layout gives up on point reads and updates. data engineering · foundational
Dec 11, 2025 Compression Blocks and the Loss of Splittability Why a compressor with a shared window makes a file unreadable from the middle, how block-structured codecs restore parallel reads, and what the block size trades away. data engineering · advanced
Dec 11, 2025 Rollback Union-Find and Offline Dynamic Connectivity How to undo a union by recording only the parent slot it overwrote, and how a segment tree over time turns edge insertions and deletions into a stack of reversible merges. data structures · intermediate
Dec 10, 2025 Certificates and the Two Definitions of NP Why "solved quickly" and "checked quickly" describe the same class, how the verifier definition is proved equivalent to nondeterministic machines, and what the certificate length bound actually constrains. computation theory · foundational
Dec 10, 2025 Discriminating Tests and the Shape of a Suspect Set How a probe partitions the set of candidate causes, why an uninformative probe is worse than no probe, and how to price a test in bits against the time it takes. observability · foundational
Dec 10, 2025 Optimizations That Move Cost Instead of Removing It Batching, precomputation, and compression reduce one metric by increasing another, so measuring only the targeted metric counts a trade as a win. performance engineering · intermediate
Dec 10, 2025 Per-App UID Isolation and the Data Directory Contract How assigning each installed app its own kernel user ID turns file permissions into an application boundary, what the private data directory guarantees, and where the model leaks. mobile computing · foundational
Dec 9, 2025 Sizing Pull-Up Resistors Against Bus Capacitance and Rise Time The two inequalities that bound a pull-up value: the rise time the mode allows and the sink current a device guarantees, and why the window closes as the bus gets faster. embedded systems · advanced
Dec 8, 2025 Durable Run State and Scheduler Reconciliation How a scheduler recovers after its own crash, why run state must be committed before a task is dispatched, and what the reconcile loop compares. data engineering · intermediate
Dec 8, 2025 Expectation-Maximization as Inference with Latent Variables Why the log outside a sum over hidden variables blocks direct maximization, how an exact E step makes a lower bound tight enough to guarantee progress, and where the fixed points end up. machine learning · advanced
Dec 8, 2025 Gamut Mapping and Rendering Intents: What Happens When a Colour Does Not Fit The four ICC rendering intents as four answers to the same clipping problem, and the difference between clipping in RGB, in a perceptual space, and by projection. computer graphics · advanced
Dec 8, 2025 Hot Code Detection with Invocation and Back-Edge Counters How runtimes decide that a function or loop is worth compiling, why method entries and loop back edges need separate counters, and what the counter arithmetic gets wrong. language runtimes · foundational
Dec 8, 2025 Inline Caches and Polymorphic Call Sites How a call site learns the shapes it has seen, what a megamorphic site costs, and why cache invalidation is the hard part of making dynamic dispatch fast. programming languages · intermediate
Dec 8, 2025 Link Training and the Width a PCIe Link Settles On What the link state machine exchanges before a single packet moves, how width and lane ordering are agreed, and why a link can train down to a fraction of its slot capability. hardware engineering · intermediate
Dec 8, 2025 Open Standards and Implementability: The Two Definitions That Do Not Match Why openness is claimed by bodies that mean different things by it, and which of the claimed properties an implementer can actually verify. computing history · intermediate

2025