Analysis of the 2001 Paxos Made Simple paper, its significance in distributed systems, and current relevance for blockchain and consensus technology.
Paxos Made Simple (2001) [Pdf]
![Paxos Made Simple (2001) [Pdf]](https://geometr.info/wp-content/uploads/2026/07/paxos-made-simple-2001-pdf-featured.jpg)
Browsing Category
Discrete Mathematics
25 posts
Girls just wanna have fast MPMC queues with bounded waiting
A new movement advocates for improved multi-party multi-channel queues with guaranteed wait times, aiming for fairness and efficiency in service systems.
Girls Just Wanna Have Fast MPMC Queues With Bounded Waiting
A new movement advocates for improved multi-party multi-channel queues to reduce wait times for women, emphasizing fairness and efficiency.
Markets Are Competitive If And Only If P != NP
New theoretical research suggests that market competitiveness hinges on the unresolved P vs. NP problem, with implications for economics and computer science.
How Discrete Math Shapes the Way Computers Handle Space
Navigating complex computer systems becomes easier with discrete math, revealing how its concepts optimize space management and core operations in surprising ways.
Why Set Logic Is the Quiet Foundation of Digital Thinking
Set logic forms the silent backbone of digital thinking by helping you…
What Euler Trails Teach Us About Route Planning
Guided by Euler trails, learn how understanding network connections can transform route planning for greater efficiency and reliability.
How Combinatorics Helps Explain Surprising Arrangement Problems
Combinatorics helps you understand surprising arrangement problems by providing tools to analyze…
Why Graph Coloring Still Shows Up in Real Scheduling Problems
Limited by complexity, graph coloring remains essential in real scheduling problems, revealing how visual methods can simplify even the most intricate resource allocations.
What Makes a Tiling Pattern Finite, Infinite, or Impossible?
A tiling pattern is classified as finite, infinite, or impossible based on…
