Complete archive
Archive
3,240 articles, newest first · page 23 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
Oct 9, 2025 Detecting DNS Tunnels from Query Structure How DNS becomes a bidirectional data channel, which structural properties of queries carry the signal, and why entropy alone is a weak discriminator against legitimate naming schemes. security · advanced - Oct 9, 2025 Resize and Intersection Observers: Delivery Inside the Rendering Update Both observers report geometry without polling, but they run at different points in the frame, and resize delivery can force a second layout that intersection delivery never causes. web platform · advanced
- Oct 9, 2025 The Log as the Filesystem: Segments, Sequential Writes, and the End of the Free-Space Map Why writing every block at the end of a log converts scattered small updates into large sequential transfers, and what replaces the allocator once nothing is ever overwritten in place. filesystems · foundational
- Oct 9, 2025 The Potential Function Behind the Inverse-Ackermann Union-Find Bound Disjoint-set forests with union by rank and path compression cost O(m alpha(n)) for m operations, and the proof is a ranked accounting over nodes rather than any single tree shape. algorithms · advanced
- Oct 9, 2025 Where the Commit Returns: Synchronous and Asynchronous Replication Boundaries What a commit acknowledgement actually guarantees at each replication mode, how quorum commits move the durability boundary, and why a synchronous replica becomes a latency dependency. databases · foundational
- Oct 8, 2025 Application Proxy Firewalls and Parser Differentials What a layer 7 proxy gains by terminating and re-originating a connection, why the parser it runs becomes an attack surface, and how two systems disagreeing about the same bytes creates a bypass. security · intermediate
- Oct 8, 2025 Block RAM Primitives and Memory Inference from RTL How dedicated memory blocks are structured internally, why inference from an array declaration produces different hardware than instantiation, and how read-during-write behaviour decides correctness. hardware engineering · foundational
- Oct 8, 2025 Critical Sections, Futexes, and What a Mutex Really Costs The path a mutex takes from uncontended atomic to sleeping thread, how Linux futexes avoid a syscall in the common case, and why uncontended cost predictions fail under contention. performance engineering · foundational
- Oct 8, 2025 Deoptimization and Frame State Reconstruction What must be rebuilt when compiled code abandons a speculative assumption, how the compiler describes frame state at each guard, and why the metadata is the expensive part of the mechanism. language runtimes · intermediate
- Oct 8, 2025 Judgment Drift and Assessor Agreement Relevance is not a stable property: label sets shift with the assessor, the interface, and the year. How kappa quantifies that disagreement and how to report metrics in light of it. information retrieval · advanced
- Oct 8, 2025 Pipeline Parallelism: Filling the Bubble and Paying for It Micro-batch pipelining lets layers be split across devices, but the schedule leaves idle slots. How bubble fraction scales with depth and why interleaved schedules help. deep learning · advanced
- Oct 8, 2025 Which ALTER TABLE Statements Rewrite the Table and Which Only Touch the Catalogue How engines decide between a catalogue edit and a full table copy, what the fast-default and instant-column mechanisms store instead, and where the boundary sits. databases · foundational
- Oct 7, 2025 Flow Sampling Error When Deciding Whether a Link Is Full How sampled flow records estimate volume, why small conversations disappear entirely, and how to tell sampling noise from a real change in traffic mix. networking · advanced
- Oct 7, 2025 How the Browser Computes the Tab Sequence The tree walk behind the Tab key: tabindex partitioning, the sequential focus navigation starting point, and why a positive tabindex can send focus backwards through the page. accessibility · foundational
- Oct 6, 2025 Dependency Resolution as Backtracking Search Over Version Sets Why choosing the newest version of each dependency in turn fails, how resolvers represent partial assignments, and what conflict-driven backjumping buys over chronological backtracking. language runtimes · foundational
- Oct 6, 2025 GHASH and the Structure of a GCM Tag Why the authenticator is a polynomial evaluation in a binary field rather than a chained MAC, how the length block prevents padding ambiguity, and what tag truncation costs in forgery probability. cryptography · intermediate
- Oct 6, 2025 Security Groups and the Stateful Connection Tracker How an interface-level firewall decides that a returning packet belongs to an existing flow, why there is no rule for replies, and what happens when the tracking table fills. cloud infrastructure · foundational
- Oct 6, 2025 Timestamp-Based Incrementality and Its Failure Modes How modification-time comparison decides which targets are stale, why clock skew, filesystem granularity and restoration of old trees break the comparison, and what the fix costs. developer tools · foundational
- Oct 5, 2025 DOS Extenders and the Cost of Leaving Real Mode Loading a protected-mode segment table, moving the interrupt path into extended memory, and reflecting calls back to real mode: what a 32-bit program had to build before it could run. computing history · advanced
- Oct 4, 2025 A-MPDU Aggregation and Block Acknowledgement How 802.11n packs many frames into one transmission, why each subframe keeps its own check sequence, and what the block ack bitmap window buys. networking · intermediate
- Oct 4, 2025 Heap Chunk Metadata and Why tcache Changed the Exploit Shape How glibc lays out an allocated chunk, what the free-list pointers in a freed chunk mean, and how a per-thread cache with no consolidation turned a single overflow into an arbitrary allocation. security · advanced
- Oct 3, 2025 Holding Delayed Jobs: Buckets, Timers, and the Cost of Time-Ordered Scans Why millions of future-dated jobs concentrate contention on one index page, how time bucketing and a separate promotion step spread it, and where in-memory timer wheels fit. backend systems · intermediate
- Oct 3, 2025 Reader-Writer Locks and the Starvation They Invite How a shared-exclusive lock counts readers in one word, why an unbroken stream of readers can postpone a writer indefinitely, and which fairness schemes actually bound the wait. operating systems · intermediate
- Oct 2, 2025 How Automated Retraining Loops Close Without Oscillating Retraining triggers, shadow evaluation, and rollback criteria: the control loop that keeps a served model current without thrashing or self-confirmation. machine learning · advanced
- Oct 2, 2025 Measuring Disorder to Size a Lateness Budget How to derive the watermark delay and allowed lateness from the arrival-delay distribution, and why a percentile is the only honest input to that choice. data engineering · intermediate
- Oct 2, 2025 Sources of Nondeterminism That Make Tests Flaky The mechanisms behind intermittent test failures — scheduling, clocks, unordered iteration, unseeded randomness — and the controls that make each source reproducible rather than merely rarer. software engineering · advanced
- Oct 2, 2025 The Flat Keyspace: What an Object Store Does and Does Not Provide Object storage maps opaque keys to immutable byte strings. The operations it omits, including rename, append, and multi-key atomicity, shape every design built on top of it. cloud infrastructure · foundational
- Oct 1, 2025 Cross-Compiling Out-of-Tree Kernel Modules A module is linked against a kernel build tree rather than a C library, which changes which compiler builds the tools, what a version magic string enforces, and why a matching configuration matters more than a matching triple. systems programming · advanced
-
September
Sep 30, 2025 Conditional GET and the Revalidation Economy How ETag and Last-Modified turn a refetch into a question, what 304 responses actually save, and why strong and weak validators answer different questions. information retrieval · intermediate - Sep 30, 2025 NX and the End of Injected Shellcode Marking the stack and heap non-executable removed the simplest payload, and the cost of that removal is paid on every page table entry and every legitimate JIT. security · foundational
- Sep 29, 2025 Birth-Death Processes and the Queue Length Equilibrium The transition diagram of a single-server queue is a birth-death chain whose stationary probabilities satisfy a flow-balance equation that yields the M/M/1 geometric distribution. scientific computing · advanced
- Sep 28, 2025 Multifrontal Factorization and the Dense Front Matrix How a sparse factorization becomes a tree of small dense problems, why that conversion is what makes it fast, and how pivoting survives in a static data structure. scientific computing · advanced
- Sep 27, 2025 Dijkstra and the Settled-Set Invariant Why extracting the minimum tentative label is safe only when weights are nonnegative, how the exchange argument proves it, and what a settled set costs in memory and bookkeeping. algorithms · foundational
- Sep 27, 2025 Feature Flags Versus Traffic Routing as Rollout Controls Why a flag and a routing weight expose different populations, what it costs to keep both code paths in one binary, and how evaluation consistency and stale defaults cause failures. devops · intermediate
- Sep 27, 2025 Pinning Data to a Region Without Freezing the Control Plane How residency constraints translate into placement rules, which metadata still leaks across borders, and why the control plane and data plane need different regionality. cloud infrastructure · intermediate
- Sep 27, 2025 Shadow DOM Boundaries and Event Retargeting Events leaving a shadow tree carry a different target for each listener on the path, and the composed flag decides whether the path crosses the boundary at all. web platform · intermediate
- Sep 26, 2025 Fsync Cost and Journal Modes on Flash Storage What a flush request actually guarantees on a phone, how SQLite synchronous levels trade durability for write latency, and why the barrier between the journal and the database file is the one that matters. mobile computing · foundational
- Sep 26, 2025 Group and Duplicate Leakage in Cross-Validation Splits Why row-level splitting fails when rows are not independent, how grouped and blocked folds restore the estimate, and what the fold count costs in group imbalance. machine learning · advanced
- Sep 26, 2025 Rendering Opportunities and When Animation Frame Callbacks Run How the browser decides to paint a frame, what requestAnimationFrame is synchronized to, and why callbacks registered during a frame land in the next one. web platform · foundational
- Sep 26, 2025 Soft Updates and Dependency Ordering Without a Journal How FFS-style filesystems enforce partial write orders that keep metadata repairable, why cycles in the dependency graph force rollback, and what it saves. filesystems · advanced
- Sep 25, 2025 Blocked and Partitioned Bloom Filters for Cache-Resident Probes Confining the k probes of a filter to one cache line, or to one slice of the array, changes the error rate by a measurable factor and the memory behaviour by an order of magnitude. data structures · intermediate
- Sep 25, 2025 Escape Analysis and Scalar Replacement of Aggregates Escape analysis decides which allocations never leave a thread or a method, and scalar replacement turns those objects into SSA values so the allocation and its fields disappear entirely. compilers · intermediate
- Sep 25, 2025 Exact Geometric Predicates and Adaptive Precision Why the sign of a determinant is the fragile part of computational geometry, how error bounds let a fast float path stay exact, and when exact arithmetic becomes unavoidable. algorithms · intermediate
- Sep 25, 2025 Lagrange Duality and the KKT Conditions in Constrained Learning How multipliers convert constrained problems into stationary points of an unconstrained function, when the dual problem has the same value as the primal, and where these conditions stop being sufficient. machine learning · intermediate
- Sep 25, 2025 Passing Build State Between Jobs Without a Shared Workspace Artifacts move through object storage, not a shared directory. How upload, transfer, and extraction fail, and how a digest manifest makes a consumer verify what it received. devops · intermediate
- Sep 24, 2025 How an Interpreter Lays Out a Stack Frame The header, locals, operand stack, and spill area of an interpreter frame, and why the frame is allocated as one block with a fixed maximum size. language runtimes · foundational
- Sep 24, 2025 State Encoding and Next-State Logic in a Finite-State Machine How the choice between binary, one-hot, and Gray encoding moves cost between flip-flops and decode logic, and why unused encodings are a reliability problem. hardware engineering · advanced
- Sep 24, 2025 Varints, Zigzag, and Prefix Encoding of Integers Why a variable-length integer encoding trades a length prefix for width, how zigzag folds signed values into the small-number space, and where the scheme degenerates to fixed width. data engineering · foundational
- Sep 23, 2025 Batching and Flush Policy in Telemetry Agents How size and time triggers interact in an export buffer, what per-request overhead a batch amortizes, and why an unbounded queue is not backpressure. observability · foundational
- Sep 23, 2025 Shipping Shared Code Outside the Release Cycle Delivering the shared layer as a replaceable bundle decouples it from the native shell, which turns every release into a matrix of shell and bundle versions and every rollback into a data-compatibility problem. mobile computing · advanced
- Sep 23, 2025 Tiered Compilation and On-Stack Replacement Why runtimes compile the same method more than once, how a frame in the middle of an interpreted loop moves into optimized code, and what the transfer must reconstruct. language runtimes · foundational
- Sep 22, 2025 Multiplexed Address and Data Buses in a Forty-Pin Package Multiplexed address and data pins let a processor with more address lines than pins reach memory, at the cost of an external latch and a shortened access window. computing history · foundational
- Sep 20, 2025 Accumulating Snapshot Fact Tables: One Row Per Process, Updated in Place How a fact row can be rewritten as an order moves through picking, shipping and delivery, which measures stay additive, and why the row must be created before the process finishes. data engineering · intermediate
- Sep 20, 2025 Covert Channels That Survive Logical Isolation Why a sandbox that prevents every direct access can still carry information through shared caches, timing, and resource contention, and what the bandwidth of each channel implies for policy. language runtimes · advanced
- Sep 20, 2025 How Many Samples a Profile Needs Before Its Numbers Mean Anything Sampling profiles are binomial estimates, not measurements; the arithmetic that turns sample counts into confidence intervals, and the differences a run can actually resolve. performance engineering · foundational
- Sep 20, 2025 What a Golden Path Guarantees: The Platform Contract as a Versioned Interface A golden path is a contract only when it declares its inputs, the runtime facts it provides, and the platform versions it tracks. What that declaration contains, and what breaks when a piece of it is missing. virtualization · foundational
- Sep 19, 2025 Multi-Head Attention as Independent Subspace Projections What the concatenation of heads buys over a single wide head, how the output rank is bounded, and why pruned heads can be removed without changing behaviour much. deep learning · foundational
- Sep 19, 2025 Ordering Guarantees and Head-of-Line Blocking A log guarantees order only within a partition, and that guarantee survives retries, consumer parallelism, and rebalances only under specific conditions. backend systems · intermediate
- Sep 19, 2025 Recognizers, Dovetailing, and Complement Asymmetry Why a machine that halts on every yes-instance but may loop on no-instances cannot be closed under complement, and how interleaved simulation converts a recognizer into one for a different set. computation theory · foundational
- Sep 19, 2025 Spelling Correction and the Did-You-Mean Suggestion How a search engine decides a query is misspelled, generates candidate corrections, and chooses whether to show them or to run the query as typed. information retrieval · intermediate