Complete archive

Archive

3,240 articles, newest first · page 1 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
Oct 25, 2026 Signed Repository Metadata and the Compromise-Resistant Update Protocol Why a signature on the artifact is not enough, how role-based metadata separates signing keys by function, and what the freshness and freeze defences cost in round trips. software engineering · advanced
Oct 24, 2026 BGP Sessions and Route Propagation over Hybrid Links How a gateway exchanges prefixes with a customer network over a dedicated link, why the AS path and local preference determine the winner, and how a flapping session poisons a route table. cloud infrastructure · advanced
Oct 24, 2026 Conditioning, Tolerances, and the Digits a Reproduction Can Demand How the condition number sets the width of the interval a computed result actually occupies, and how that interval determines which differences between two runs are meaningful. scientific computing · advanced
Oct 24, 2026 How a DFA Decides Membership: Transition Tables and the Extended Transition Function The five-tuple, the recursive lift of the transition function to whole strings, and the table layouts that make each input symbol cost one dependent load. computation theory · foundational
Oct 24, 2026 Signals as Deferred Interrupts and the Async-Signal-Safe Subset How a signal handler interrupts an arbitrary instruction, why most library calls are unsafe inside one, and what the small permitted subset actually guarantees. computing history · intermediate
Oct 23, 2026 Balance Factors, and Why AVL Deletion Cascades How two bits per node encode the AVL invariant, why an insertion repair stops at the first rotation while a deletion repair can climb to the root, and what the child balance factor decides. data structures · foundational
Oct 23, 2026 How a Loadable Module Resolves Symbols Against the Kernel A module is an unlinked ELF object, not a program. How the loader binds its undefined names, why exported symbols carry version CRCs, and what vermagic refuses to load. operating systems · foundational
Oct 23, 2026 Precedence Climbing for Binary Expressions How a loop with a minimum-binding-power parameter parses operator precedence and associativity in one function, and how its behaviour maps onto the grammar it replaces. compilers · intermediate
Oct 23, 2026 Quorum Intersection: Why R + W > N Is Necessary but Not Sufficient What the quorum inequalities actually prove about read-write overlap, why they say nothing about the newest value, and where per-key quorums break down across a cluster. databases · intermediate
Oct 23, 2026 Refresh Token Rotation and Replay Detection How rotating refresh tokens limit the value of a stolen credential, why a used token presented twice means compromise, and how a grace window keeps honest clients from tripping the alarm. backend systems · advanced
Oct 23, 2026 Setup and Hold Slack: Reading a Static Timing Report How arrival and required times are propagated through a timing graph, why setup and hold checks run in opposite directions, and how skew, derating, and path exceptions change the verdict. hardware engineering · intermediate
Oct 23, 2026 Testing DFA Equivalence with Union-Find Instead of a Product Table Why two machines accept the same language exactly when no reachable pair is split by acceptance, and how merging pairs in a disjoint-set structure avoids building the product. computation theory · advanced
Oct 22, 2026 Ray-Triangle Intersection and the Watertight Edge Test How the ray-triangle test is derived from Cramer rule, why shared edges produce pinhole artifacts, and what a watertight edge function buys and costs. computer graphics · foundational
Oct 22, 2026 Tunnel Encapsulation Overhead and Path MTU Discovery How many bytes each overlay scheme adds, why ICMP-based path MTU discovery breaks across a tunnel, and the options for keeping an inner frame inside the underlay MTU. networking · foundational
Oct 22, 2026 Voltage and Frequency Domains: Why DVFS Is Not One Knob How a frequency change requires a voltage change, why level shifters and synchronisers appear at domain boundaries, and what latency an operating-point transition really costs. computer architecture · intermediate
Oct 21, 2026 Directed Graphical Models: D-Separation and the Markov Blanket How a directed acyclic graph selects a factorization, why three path shapes reduce to one blocking rule, and what the Markov blanket lets an algorithm ignore. machine learning · foundational
Oct 21, 2026 Singly Linked Lists: One Pointer per Node and the Cost of Unidirectional Traversal How a head pointer and a next field support O(1) splicing, why deletion needs the predecessor, and what pointer chasing costs on a modern cache hierarchy. data structures · foundational
Oct 21, 2026 Stack and Memory Budgeting for a Set of Preemptive Tasks Why each task needs its own stack, how worst-case stack depth is computed from the call graph plus exception frames, and where a shared stack changes the accounting. embedded systems · advanced
Oct 20, 2026 fsck and the Ordering of Repairs Why the consistency passes run in a fixed order, how each pass builds the data the next one needs, and why some findings can only be resolved by discarding data. filesystems · advanced
Oct 20, 2026 Network ACLs and Stateless Filtering at the Subnet Boundary Why an ordered, stateless rule list needs an explicit rule for return traffic, how ephemeral port ranges make that rule hard to write, and where the ACL is evaluated relative to the interface. cloud infrastructure · intermediate
Oct 20, 2026 Sections, Symbols, and Relocations in an ELF Object File Why a compiled object file is more than machine code: the section header table, the symbol table and its string table, and the relocation records a linker consumes. compilers · foundational
Oct 20, 2026 Sharded Counters, Padding, and False Sharing Why two independent counters placed next to each other can cost more than one shared counter, how cache-line granularity forces padding, and what sharding gives up in exchange. performance engineering · intermediate
Oct 19, 2026 Ambiguity, Equivalence, and Other Undecidable Grammar Questions Membership in a context-free language is decidable, but asking whether two grammars denote the same language is not, and neither is asking whether one is ambiguous. computation theory · advanced
Oct 19, 2026 Hash Trees and the Root of Trust in a Checksummed Filesystem Why per-block checksums need a chain to a single trusted value, how Merkle trees make tampering localisable, and what the root itself has to be protected against. filesystems · advanced
Oct 19, 2026 Leaderless Ordering: Dependency Graphs Instead of a Single Log How per-command sequence numbers and dependency sets let replicas commit concurrently, why conflicts still impose an order, and where recovery becomes the expensive part. distributed systems · advanced
Oct 19, 2026 Progressive Delivery Controllers as Reconciliation Loops How a rollout becomes a cluster object with a status field, how the controller moves traffic through a provider abstraction, and where the loop conflicts with autoscalers and GitOps sync. devops · advanced
Oct 18, 2026 Page Splits and the Write Cost of a Single B-Tree Insert What an insert actually writes when a leaf page has no room, why the split propagates to the root, and how fill factor and right-links change the count. databases · intermediate
Oct 18, 2026 Release Gates: Verifying the Cut Before It Ships What a release gate can mechanically check, why reproducibility is the only claim about a build that a second machine can settle, and how a gate fails without becoming a step people bypass. devops · advanced
Oct 18, 2026 The Bilinear Transform and Frequency Warping How mapping the analog frequency axis onto the unit circle produces a stable digital filter, why the cutoff moves, and how prewarping compensates for it. scientific computing · intermediate
Oct 17, 2026 Zoned Block Devices and the Zone Append Model How zone semantics replace the random-write abstraction with explicit sequential-write regions, what append buys, and which costs move from the device to the host. filesystems · advanced
Oct 16, 2026 Choosing Between fp16 and bf16: Exponent Range and Mantissa Budget Both formats are 16 bits, but they split those bits differently. The split decides whether a training run needs loss scaling and how much precision each weight update retains. deep learning · foundational
Oct 16, 2026 Lanczos Iteration and Shift-Invert for Extreme Eigenvalues How a three-term recurrence reduces a large symmetric matrix to a tridiagonal one, which eigenvalues that reduction can resolve, and why shift-invert changes the question being asked. scientific computing · advanced
Oct 16, 2026 Minimal Version Selection and Its Compatibility Assumption How Go chooses the maximum of declared minimum versions, why that rule needs no backtracking, and what an ecosystem gives up when its requirement language has no upper bounds. developer tools · intermediate
Oct 15, 2026 Bank Conflicts Inside GPU Shared Memory How a shared-memory address selects one of thirty-two banks, when the hardware serves a warp in a single pass, and why padding a tile by one column removes a thirty-two-way serialization. gpu computing · intermediate
Oct 15, 2026 Variational Inference and the Evidence Lower Bound Why maximizing a lower bound replaces integrating a posterior, how mean-field updates are derived coordinate by coordinate, and what the bound systematically understates. machine learning · advanced
Oct 14, 2026 Reachability, Retention, and What Counts as a Leak Why unreachable memory and unfreed memory are different problems, how a tracing collector decides an object is dead, and where conservative roots keep garbage alive. memory systems · intermediate
Oct 14, 2026 Request Cloning and Body Streams in Fetch Handlers Why a fetch handler cannot both return a response and store it without cloning, how tee behaves under backpressure, and which bodies the Cache API refuses to store. web platform · intermediate
Oct 13, 2026 Shared State Without a Shared Heap Two platform runtimes cannot hold the same objects, so cross-platform state lives in an external store with subscription and persistence semantics that the framework must define itself. mobile computing · intermediate
Oct 13, 2026 Token Substitution and Tree Substitution in Macro Expansion Why the C preprocessor rewrites flat token sequences while Lisp macros rewrite parsed forms, and how that choice changes precedence bugs, argument checking, and whether expansion is guaranteed to terminate. programming languages · foundational
Oct 13, 2026 Variadic Calls and the Default Argument Promotions What a va_list actually points at, why float and char arguments are widened before a variadic call, and how the absence of type information turns a wrong format into undefined behaviour. systems programming · intermediate
Oct 13, 2026 Why Append-Only Keys Concentrate Load on One Shard Monotonic keys place every insert at the end of the key space, so one partition absorbs the write traffic. The fixes, from bit-reversal to bucket suffixes, and what each costs. distributed systems · intermediate
Oct 12, 2026 Attributing Rendering Work: Reading Traces Without Guessing How to tell script time from style, layout, paint, and raster in a frame trace, which entry types expose the same information to code, and how to sample without fooling yourself. web platform · advanced
Oct 12, 2026 Bus Matrix Arbitration and What DMA Contention Costs the Core How a multi-master bus fabric picks a winner when the core and a DMA engine target the same SRAM, why round-robin is not always fair, and how contention shows up as jitter. embedded systems · intermediate
Oct 12, 2026 Causal Masking, Additive Mask Terms, and Where the Mask Enters the Softmax Why a causal constraint is expressed as negative infinity added to the logits, how padding and causality combine in one layer, and which arithmetic the mask must precede. deep learning · intermediate
Oct 12, 2026 Condition Number, Residual, and Backward Error Why a small residual does not imply a small error, how the condition number splits the blame between problem and algorithm, and how to estimate it without forming an inverse. scientific computing · intermediate
Oct 12, 2026 Constructing an S-Box: Field Inversion and Differential Uniformity Why the AES substitution table is an inverse map in GF(2^8) followed by an affine transform, and how differential uniformity bounds the best characteristic. cryptography · intermediate
Oct 12, 2026 Dynamic Task Mapping: Graphs Expanded at Run Time What changes when the number of tasks is unknown at definition time, how map indices are keyed, and why the reduce step is the hard part. data engineering · advanced
Oct 12, 2026 Issue Queue Wakeup and Select: The Scheduler Inside the Window How a queue of waiting instructions learns that its operands are ready, how one instruction per port is chosen each cycle, and why the broadcast network is the hard part. computer architecture · intermediate
Oct 12, 2026 The Cook–Levin Tableau: Encoding a Computation as a Formula How a nondeterministic polynomial-time computation becomes a boolean formula whose satisfying assignments correspond exactly to accepting runs, and what the encoding costs in variables and clauses. computation theory · intermediate
Oct 11, 2026 Bit Packing and Frame-of-Reference Blocks How choosing a bit width per block of postings beats byte-aligned codes, what the block maximum costs in wasted bits, and why patched exceptions sometimes beat both. information retrieval · intermediate
Oct 11, 2026 Referential Transparency and the Substitution Test What it means for an expression to be replaceable by the value it denotes, which features break that property, and what compilers and proofs gain when it holds. programming languages · foundational
Oct 10, 2026 Where Address-Space Randomisation Gets Its Entropy Which regions are randomised, how many bits of entropy each actually receives, and why a single leaked pointer can undo the whole arrangement. security · intermediate
Oct 9, 2026 Abort Paths and the Blackout Window A migration can fail at any point, and what the guest experiences depends on which side still holds a complete state. The ordering of commit, acknowledgement, and source teardown defines what rollback is possible. virtualization · advanced
Oct 9, 2026 Availability Multiplication in Synchronous Service Graphs Why end-to-end availability is the product of every dependency on the request path, how fan-out changes that product, and which edges can be removed or made optional. software architecture · foundational
Oct 9, 2026 Counting and Radix Sort: Choosing the Pass Count and the Digit Width How stable counting sort works in one linear pass, how LSD radix composes passes, and how digit width trades passes against counter size. algorithms · intermediate
Oct 9, 2026 Futures as Write-Once Cells: Polling, Waking, and Cancellation The shared state inside a future, why a poll-based executor needs a waker at all, and how the same cell supports both asynchronous completion and cancellation. programming languages · foundational
Oct 9, 2026 Topological Order From Finish Times and Why the Reverse Is the Answer The finish-time argument that makes reverse post-order a valid topological sort, why the reverse prefix order is not, and how cycle detection folds into the same traversal. algorithms · intermediate
Oct 8, 2026 Binder IPC: Parcels, Handles, and One-Way Calls How a single-copy parcel transfer works, what a binder handle actually names, and why one-way calls have ordering guarantees but no completion signal. mobile computing · intermediate
Oct 8, 2026 Conservative Rasterization and the Guarantee of Non-Empty Coverage Standard rasterization may miss a pixel that a triangle touches, which breaks shadow volumes and voxelization; conservative rasterization over-covers by a bounded margin to make touching sufficient. computer graphics · intermediate
Oct 8, 2026 Point-in-Time Correctness in Training Set Assembly Joins between labels and features must respect event time, not ingestion time; how to build a training table that never sees the future. machine learning · foundational

2026