Get personalized book recommendations based on your reading history and preferences. Our algorithm analyzes your favorite books and reading patterns to suggest your next great read.

"Consensus algorithms" as a book category covers the theory, design, implementation, and evaluation of protocols that enable a group of independent agents or nodes to agree on a single value or sequence of actions despite failures, delays, or malicious behavior. Titles in this category range from theoretical treatments (e.g., Byzantine agreement, FLP impossibility, formal proofs and complexity bounds) to practical guides and case studies (e.g., Paxos, Raft, PBFT, Proof-of-Work/Stake, and their implementations in databases, distributed systems, and blockchains). Books may address related disciplines such as cryptography, fault tolerance, networking, game theory, and formal verification, and often cover performance, scalability, security trade-offs, and real-world deployment patterns. The audience includes graduate students and researchers seeking rigorous foundations, software engineers and system architects building resilient services, and blockchain developers wanting protocol-level understanding and best practices. Overall, the category blends deep theory with hands-on engineering and cross-cutting concerns about trust, consistency, and coordination in distributed environments.

Filter books by their publication year. Enter the earliest year (Start) and latest year (End) to find books published within that period. Leave either field empty to search from the beginning of time or up to the present day.