Complete archive
Archive
3,240 articles, newest first · page 33 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
Feb 28, 2025 Runtime Self-Tests and Diagnostic Coverage Measurement How startup and periodic self-tests establish that safety mechanisms still work, how coverage is measured by fault injection, and why a high percentage hides a distribution. embedded systems · intermediate - Feb 27, 2025 OAuth 2.0 and the Implicit Grant: Removing a Token from the Browser Why the implicit grant existed, what the browser redirect model made impossible to secure, and how the password and hybrid grants traded a front-channel leak for a different attack surface rather than eliminating it. computing history · advanced
- Feb 27, 2025 Testing Reflow, Zoom, and Text Spacing How the reflow, resize-text, and text-spacing criteria turn layout questions into arithmetic on viewport width, scroll extents, and computed font metrics. accessibility · advanced
- Feb 27, 2025 Trait Coherence and Orphan Rules in Open Worlds Why a global instance table needs an ownership restriction, how orphan rules prevent overlapping implementations, and what coherence costs downstream crates. programming languages · advanced
- Feb 26, 2025 Evaluation Semantics of a Policy Query Language Why a policy language evaluates rules as queries over a document, how undefined differs from false, and where the cost of a rule actually goes. devops · foundational
- Feb 25, 2025 What a SHA-512 Integrity Hash in Package Metadata Actually Proves Subresource Integrity, package lockfile digests, and Go checksums look alike but answer different questions about who computed the hash and what it covers. security · foundational
- Feb 24, 2025 Decode Bandwidth and the Cost of Variable Instruction Length Why fixed-width instructions let a front end decode several per cycle, how variable-length encodings force serial scanning, and where the two approaches land on fetch and decode throughput. computer architecture · advanced
- Feb 24, 2025 HyperLogLog: Estimating Cardinality from a Register Array How stochastic averaging over harmonic means turns a fixed array of small registers into a cardinality estimate with roughly 1.04/sqrt(m) relative error. data structures · intermediate
- Feb 24, 2025 Lexicographic Enumeration and Range Scans over a Trie A trie yields keys in sorted order without a sort step. How depth-first traversal, ordered child storage, and iterator state interact, and why range scans cost what they cost. data structures · foundational
- Feb 24, 2025 Ranking Documentation Search When the Query Is an Error String Documentation queries are lookups, not explorations. Identifier tokenisation, field weighting, and version duplication decide whether the entry a reader needs appears at all. software engineering · advanced
- Feb 24, 2025 Timer Wheels and the Cost of Finding the Next Expiry Why a sorted list or a heap is the wrong structure for thousands of concurrent timers, how a hashed wheel amortises the work, and what the resolution trade costs. operating systems · intermediate
- Feb 22, 2025 Acknowledgements, Offsets, and Visibility Timeouts A broker can learn about completion only through an explicit signal or an expiring lease, and the timing of both decides how much work is repeated after a crash. backend systems · foundational
- Feb 22, 2025 Artifact Provenance from Commit to Deployed Digest Signed attestations bind an artifact digest to the materials and builder that produced it. What the statement must contain, how it is verified, and which attacks it does not stop. devops · advanced
- Feb 22, 2025 Composing Probabilistic Checks: Why Error Budgets Do Not Add Chaining filters and sketches multiplies false positives instead of summing them, correlation between stages breaks the union bound, and the pipeline error is dominated by the weakest stage. data structures · advanced
- Feb 22, 2025 Structural Subtyping and the Variance Lattice Why a record with more fields fits where fewer are expected, why function arguments run the other way, and why a mutable field destroys both. programming languages · foundational
- Feb 22, 2025 Warmup Transients and Detecting Steady State in Timed Loops Why the first iterations of a timed loop measure a different program, which subsystems are still converging, and how to locate the transition into steady state rather than assuming it. performance engineering · foundational
- Feb 22, 2025 Why a Replication Slot Pins Write-Ahead Log and How to Bound It The retention rule that makes a slot hold log segments until a consumer confirms them, the disk consequence of an idle slot, and the settings that cap it. databases · advanced
- Feb 21, 2025 Connection Draining and In-Flight Request Handling at Cutover How an instance retires without dropping requests: deregistration order, keep-alive reuse, TCP and TLS teardown, and the timers that decide whether clients see errors. devops · foundational
- Feb 21, 2025 Reversed-Z: Using Floating-Point Depth Without Wasting It Standard depth mapping spends almost all of a floating-point buffer near the near plane; reversing it to 1 at the near plane and 0 at the far plane redistributes precision where it is needed. computer graphics · advanced
- Feb 20, 2025 Grid-Stride Loops and Launch Size Independence Why the grid-stride loop survives shrunken launches and changing problem sizes, what it costs against a one-element-per-thread kernel, and when it is the wrong shape. gpu computing · foundational
- Feb 20, 2025 PNG Chunk Framing and Scanline Filter Reconstruction How PNG splits an image into type-tagged chunks around one deflate stream, and why the five scanline filters must be undone before pixels exist at all. computer graphics · foundational
- Feb 19, 2025 Column Statistics and the Page-Skipping Decision How min/max bounds, null counts, and bloom filters let a reader discard data without decoding it, and why clustering, sorting, and type all change how much they prune. data engineering · intermediate
- Feb 19, 2025 Global Error Accumulation and the CFL Condition How local truncation errors combine across steps, why the von Neumann analysis of explicit advection produces the Courant number bound, and what propagation velocity has to do with it. scientific computing · foundational
- Feb 19, 2025 Lowlink Values: How One DFS Pass Finds Strongly Connected Components Why the minimum reachable discovery index identifies component roots, why edges to finished components must be ignored, and how the output order relates to the condensation. algorithms · advanced
- Feb 18, 2025 Kexec: Booting a Second Kernel Without Firmware How a running kernel loads a replacement image into reserved memory, what the relocation blob does during the jump, and why the crash kernel needs its own reservation and its own devices. operating systems · advanced
- Feb 18, 2025 Storage Pressure: What a Device Does When the Disk Fills How the platform reclaims space from caches under pressure, why a nearly full flash volume slows down before it fails, and how an app should budget and shed data before the system does it. mobile computing · advanced
- Feb 17, 2025 Response-Time Analysis for Fixed-Priority Task Sets The recurrence that computes exact worst-case response time, why it converges, what the blocking term adds, and where the critical instant assumption costs pessimism. embedded systems · intermediate
- Feb 16, 2025 Intent Resolution, Exported Components, and URI Grants How a late-bound call is matched to a component, what makes a component reachable from other apps, and why a URI permission is a separate grant from the intent that carries it. mobile computing · advanced
- Feb 15, 2025 Multi-Dimensional Transfer Functions and the Gradient-Magnitude Histogram Why a value-only transfer function cannot separate two materials with the same density, how the joint histogram of value and gradient magnitude classifies boundaries, and what the extra dimensions cost. scientific computing · intermediate
- Feb 14, 2025 Consumer-Driven Contract Testing and the Cost of Many Consumers How consumer expectations become executable contracts, what verification proves about a provider, and why the pattern needs a broker and a deployment gate to be worth its cost. software architecture · advanced
- Feb 14, 2025 Diamond Dependencies and Duplicate Versions What happens when two packages require incompatible versions of a third, why some installers keep both copies, and what duplication costs in type identity, disk space, and patch coverage. developer tools · intermediate
- Feb 14, 2025 From Command Name to Process: The execve Argument Contract How a typed command becomes a running program, what the kernel inspects before the first instruction executes, and which process state survives the replacement. developer tools · foundational
- Feb 13, 2025 Concurrent Index Builds and the Invalid Index They Can Leave Behind Why a non-blocking index build performs two scans, what state it commits between them, and how a failure leaves an index that exists but cannot be used. databases · intermediate
- Feb 12, 2025 Attribute Conditions: Constraining Access by Tag Instead of by Name How principal tags and resource tags become condition keys, why the two-sided check needs both halves, and what happens when a tag is missing or renamed. cloud infrastructure · intermediate
- Feb 12, 2025 Feature Visualisation and What Convolutional Filters Reveal Optimising an input image against a single neuron, what regularisation each term contributes, and the evidence that early filters are oriented edge detectors. deep learning · advanced
- Feb 12, 2025 Message Matching: Tags, Ordering, and the Deadlock in Naive Exchange How a receive identifies its message, what the non-overtaking rule does and does not guarantee, and why a ring exchange deadlocks only above a size threshold. scientific computing · foundational
- Feb 12, 2025 Positioning and Stacking Contexts How out-of-flow boxes resolve their offsets, which ancestor supplies their containing block, and how z-index orders boxes through nested stacking contexts. web platform · intermediate
- Feb 12, 2025 Saved State, Process Death, and the Bundle Size Limit What survives when the platform reclaims an app process, how the saved-state channel is serialised through the system service, and why its size is capped. mobile computing · intermediate
- Feb 11, 2025 Gradient Clipping by Norm and Loss-Scale Rescaling What a per-tensor global norm clip bounds, how the scale factor is computed and applied, and why clipping interacts with the loss scale used in low-precision training. deep learning · intermediate
- Feb 11, 2025 Packfiles, Delta Chains, and What Garbage Collection Actually Deletes How loose objects become delta-compressed packs, why delta chains are depth-limited, and how reachability decides what survives a prune. software engineering · advanced
- Feb 11, 2025 Uninitialised Memory, Padding, and the Cost of Assuming Zero Uninitialised bytes are not merely arbitrary values, they are a distinct state the optimiser tracks, and the distinction changes what a byte copy, a comparison, and a length assignment may legally do. systems programming · intermediate
- Feb 10, 2025 Block Compression and Columnar Layout for Log Storage Why compressing a block of records beats compressing each record, how column-wise encoding exposes value locality, and what the block size trades away. observability · advanced
- Feb 10, 2025 Error Types and Recovery in a Type Checker How a checker keeps going after the first type error without accepting nonsense, what an error type must absorb, and why the count of reported errors is a design decision. compilers · advanced
- Feb 9, 2025 The Terminal Line Discipline: Canonical Mode, Echo, and Raw Input How the kernel edits and interprets keystrokes before a program sees them, why Ctrl-C never arrives as a byte, and what changing to raw mode actually switches off. developer tools · advanced
- Feb 8, 2025 Flit Mode and PAM4: How PCIe Reached 64 GT/s Why the next rate step required four signal levels instead of two, why that forces forward error correction into the physical layer, and what fixed-size flits replace. hardware engineering · advanced
- Feb 8, 2025 Signature Nonces: The Single Secret That Breaks ECDSA How the per-signature nonce turns a signature equation into a solvable linear system when it repeats or leaks, and how deterministic derivation removes the randomness requirement. cryptography · advanced
- Feb 7, 2025 Trust Boundaries in Shared Build Caches A cache entry written by an untrusted build is an input to a trusted one. How key collisions become code execution, why content addressing does not help, and how namespaces separate the two. devops · intermediate
- Feb 6, 2025 Concentration Inequalities for Algorithm Analysis: Chernoff, Azuma, and Their Assumptions How to turn an expected cost into a probability of exceeding a threshold, which inequality applies to which dependency structure, and what each one silently assumes. algorithms · advanced
- Feb 6, 2025 Supervision Trees and the Shape of a Failure Domain How restart strategies bound the blast radius of a failure, what restart intensity actually counts, and why restarting a supervisor can be worse than losing the work it held. programming languages · advanced
- Feb 5, 2025 Monomorphic Inline Caches and the Guard That Makes Them Work How a single cached layout and offset turn a dynamic property access into a compare and a load, what the guard must verify beyond layout identity, and why one shape is the case worth optimizing hardest. language runtimes · foundational
- Feb 4, 2025 Achieved Bandwidth Versus the Quoted Peak Why a measured stream rate falls short of the number on the datasheet, how to count the bytes a kernel really moved, and which part of the gap is structural. gpu computing · foundational
- Feb 4, 2025 Detailed Balance and the Stationary Distribution of a Markov Chain A single equation on the transition kernel guarantees that a distribution is stationary, which is what turns a chain of biased moves into a sampler for an arbitrary target. scientific computing · intermediate
- Feb 4, 2025 Silent Data Corruption and What Device Error Reporting Misses Why a read can succeed and still return the wrong bytes, how drives separate correctable from uncorrectable errors, and which corruption classes no device is able to report. filesystems · foundational
- Feb 3, 2025 GPU Page Faults and Demand Migration in Unified Memory How a device MMU fault suspends a warp, what the driver does with the faulting address, and why migration granularity decides whether oversubscription works at all. gpu computing · intermediate
- Feb 3, 2025 Over-Fetch and Exact Reranking in Two-Stage Vector Retrieval Why an approximate candidate list must be wider than the final result set, how to size the over-fetch from the approximation error, and where the rerank stage changes the answer. information retrieval · advanced
- Feb 3, 2025 Sequencing a Cutover Against a Dependency Graph Why the ordering of moves is constrained by who calls whom, how to find a valid sequence, and what happens when the graph contains a cycle. cloud infrastructure · advanced
- Feb 3, 2025 Why a Training Step Costs Three Times Its Forward Pass The parameter-times-token accounting behind training compute budgets, where the factor of three comes from, and when attention terms make the estimate wrong. deep learning · foundational
- Feb 1, 2025 The Analytical Engine Store, Mill, and Barrel Control How a planned 1830s engine separated storage from arithmetic, sequenced operations from punched cards, and used a studded barrel as a microprogram store. computing history · intermediate
-
January
Jan 31, 2025 Structured Fields Versus Formatted Message Strings What is lost when a log record is a printf template, how field-value encoding preserves types, and why templates still matter for cardinality. observability · foundational - Jan 30, 2025 Extendible Hashing and Why the Directory Doubles How a trie of hash bits lets a file grow one bucket at a time, why the directory doubles rather than the file, and what the indirection costs on every probe. algorithms · intermediate