Theory
536 posts in category “Theory”.
Designing A Consistent Hashing Ring With Virtual Nodes For Load Balancing
2025-04-13A comprehensive technical exploration of designing a consistent hashing ring with virtual nodes for load balancing, covering key concepts, practical implementations, and real-world applications.
The Realities Of Implementing A Distributed Transaction Protocol: Percolator Vs. Spanner
2025-04-13A comprehensive technical exploration of the realities of implementing a distributed transaction protocol: percolator vs. spanner, covering key concepts, practical implementations, and real-world applications.
The Fast Fourier Transform: From Cooley-Tukey to Modern Signal Processing and Fast Multiplication
2025-04-12Master the FFT from first principles: the Cooley-Tukey algorithm as recursive divide-and-conquer, the underlying group theory, modern variants for arbitrary sizes, and applications from polynomial multiplication to GPU signal processing.
Building A Simple Oauth 2.0 Authorization Server: Tokens, Scopes, And Refresh Flows
2025-04-11A comprehensive technical exploration of building a simple oauth 2.0 authorization server: tokens, scopes, and refresh flows, covering key concepts, practical implementations, and real-world applications.
A Practical Guide To Implement The C5.0 Decision Tree Algorithm From Scratch
2025-04-06A comprehensive technical exploration of a practical guide to implement the c5.0 decision tree algorithm from scratch, covering key concepts, practical implementations, and real-world applications.
Optimizing Matrix Multiplication: From Strassen To Coppersmith Winograd And Beyond
2025-04-03A comprehensive technical exploration of optimizing matrix multiplication: from strassen to coppersmith winograd and beyond, covering key concepts, practical implementations, and real-world applications.
Implementing A Distributed Key Value Store With Conflict Free Replicated Data Types (crdts)
2025-04-01A comprehensive technical exploration of implementing a distributed key value store with conflict free replicated data types (crdts), covering key concepts, practical implementations, and real-world applications.
The Internals Of A Modern Garbage Collector: Generational, Concurrent, And Compacting (like C4)
2025-03-30A comprehensive technical exploration of the internals of a modern garbage collector: generational, concurrent, and compacting (like c4), covering key concepts, practical implementations, and real-world applications.
The PCP Theorem: Why Some Problems Are Hard Even to Approximate
2025-03-30Unpack one of theoretical computer science's crown jewels: the PCP theorem, which shows that for many NP-hard problems, even finding an approximate solution is intractable — and how probabilistically checkable proofs revolutionized our understanding of hardness.
The Curry-Howard Correspondence: How Type Theory Bridges Proof and Computation
2025-03-18Explore the profound isomorphism between logical proofs and computer programs: how the Curry-Howard correspondence unifies propositional logic with typed lambda calculus, and how it enables modern proof assistants like Coq, Lean, and Agda.
From Code To Silicon: Designing A Simple Risc V Cpu Pipeline In Verilog
2025-03-15A comprehensive technical exploration of from code to silicon: designing a simple risc v cpu pipeline in verilog, covering key concepts, practical implementations, and real-world applications.
Building A Hybrid Logical Clock For Causal Consistency In Geo Distributed Systems
2025-03-14A comprehensive technical exploration of building a hybrid logical clock for causal consistency in geo distributed systems, covering key concepts, practical implementations, and real-world applications.
Cache Oblivious Algorithms: Why And How To Optimize For Unknown Cache Hierarchies
2025-03-05A comprehensive technical exploration of cache oblivious algorithms: why and how to optimize for unknown cache hierarchies, covering key concepts, practical implementations, and real-world applications.
Shannon's Information Theory from First Principles: Entropy, Channel Capacity, and the Fundamental Limits of Communication
2025-03-05Build Shannon's information theory from the ground up: entropy as a measure of uncertainty, source coding theorem, channel capacity, and the noisy-channel coding theorem that established the theoretical limits of reliable communication.
Landauer's Principle and the Thermodynamics of Computation: Why Bits Have an Energy Floor
2025-02-22Explore the deep connection between thermodynamics and information: Landauer's principle that erasing a bit costs kT ln 2 in energy, the Maxwell's demon resolution, and the quest for reversible, energy-efficient computing.
Implementing A Lock Free Queue With Memory Reclamation Using Epoch Based Reclamation
2025-02-21A comprehensive technical exploration of implementing a lock free queue with memory reclamation using epoch based reclamation, covering key concepts, practical implementations, and real-world applications.
The Paxos Vs. Raft Debate: A Practical Implementation And Performance Comparison
2025-02-21A comprehensive technical exploration of the paxos vs. raft debate: a practical implementation and performance comparison, covering key concepts, practical implementations, and real-world applications.
Write Ahead Logging Under The Hood: Designing A Durable Wal For An Lsm Tree Storage Engine
2025-02-04A comprehensive technical exploration of write ahead logging under the hood: designing a durable wal for an lsm tree storage engine, covering key concepts, practical implementations, and real-world applications.
Taming Tail Latency In Microservices: A Deep Dive Into Request Coalescing And Hedged Requests
2025-01-30A comprehensive technical exploration of taming tail latency in microservices: a deep dive into request coalescing and hedged requests, covering key concepts, practical implementations, and real-world applications.
Linearizability and Serializability: A Formal Hierarchy of Consistency Models
2025-01-28Build a rigorous understanding of consistency models from linearizability to eventual consistency, with formal definitions, counterexamples, and the practical implications for distributed database design.
Zero Knowledge Proofs In Practice: Implementing Zk Snarks For Privacy Preserving Transactions
2025-01-21A comprehensive technical exploration of zero knowledge proofs in practice: implementing zk snarks for privacy preserving transactions, covering key concepts, practical implementations, and real-world applications.
The FLP Impossibility Result: Why Distributed Consensus Is Fundamentally Hard
2025-01-15Explore the landmark Fischer-Lynch-Paterson result that proved no deterministic algorithm can achieve consensus in an asynchronous system with even one faulty process — and how the field evolved around this impossibility.
Building A Jit Compiler For A Subset Of Python Using Llvm
2025-01-07A comprehensive technical exploration of building a jit compiler for a subset of python using llvm, covering key concepts, practical implementations, and real-world applications.
The Mathematics Of Raft: Formal Verification Of Leader Election In Distributed Consensus
2025-01-07A comprehensive technical exploration of the mathematics of raft: formal verification of leader election in distributed consensus, covering key concepts, practical implementations, and real-world applications.