This article explains how unreliable networks, clock instability, and node failures can cause data inconsistency in distributed clusters, introduces the Raft consensus algorithm, details its roles, election process, log replication, read/write handling, consistency models, and mechanisms to avoid split-brain and livelock.
This article explores the purpose of database transactions, the various failure scenarios they guard against, the nuances of consistency across ACID, replica and CAP models, and how atomic commit and consensus mechanisms ensure reliable distributed data processing.
This article provides a comprehensive overview of ZooKeeper, covering its purpose as a distributed coordination service, design objectives such as consistency and reliability, hierarchical data model, session and watch mechanisms, consistency guarantees, leader election and Zab protocol, as well as practical deployment details.
This article explains the role of consensus algorithms in achieving high‑availability through redundancy and automatic failover, clarifies distributed consistency, explores the CAP theorem and its C component, and introduces the BASE theory as a practical complement for eventual consistency in modern distributed systems.
This article explores how to build fault‑tolerant distributed systems by formalizing consensus, outlines its core properties, explains the FLP impossibility theorem, and shows how algorithms like Raft sidestep its limits through timing constraints and recovery mechanisms.
Designing distributed systems often falls prey to misconceptions such as assuming reliable networks, zero latency, unlimited bandwidth, inherent security, static topology, zero transmission cost, and full autonomy, but applying retries, idempotency, message queues, encryption, dynamic discovery, caching, and time protocols can mitigate these issues.
This article distills the key design patterns behind distributed systems—covering replication, partitioning, consensus, and fault‑tolerance—by presenting each pattern’s problem statement, concrete solution, trade‑offs, and technical considerations, all illustrated with real‑world examples from projects like Kafka and Cassandra.
This article explores how Alibaba’s Nuwa service and the open‑source ZooKeeper implement distributed read‑write locks using sequential files, detailing the challenges of maintaining cversion order during failover and the community’s solutions to ensure consistency and reliability.
This article explains blockchain by distinguishing its narrow definition as a cryptographically linked data structure from its broader view as a decentralized infrastructure, and then details blocks, headers, bodies, hash functions, chain structure, Merkle trees, timestamps, asymmetric encryption, P2P networking, data propagation, and validation mechanisms.
This article examines the core implementation of SOFAJRaft, a high‑performance Java library based on the Raft consensus algorithm, covering node initialization, leader election, log replication, snapshot handling, fault recovery, and multi‑Raft‑Group support with detailed code examples.
This article explains the fundamentals of Proof of Work and Proof of Stake consensus mechanisms, compares their advantages and drawbacks, and introduces Bitcoin wallet types along with the step‑by‑step process of generating mnemonic phrases for hierarchical deterministic wallets.
This article provides a comprehensive tutorial on adding log snapshotting (snapshotting) to a Raft‑based distributed key‑value store, explaining the motivation, the snapshot mechanism, and detailed Go code for generating, transferring, applying, and persisting snapshots to reduce log size and improve performance.
This article examines how Xline performs safe cluster membership changes, comparing Joint Consensus and single‑step approaches, and provides a detailed source‑code walkthrough of leader and follower handling, configuration commits, node addition, removal, and the integration with the Curp protocol.
This article explains the Raft consensus algorithm, detailing its roles, leader election process, term management, fault handling, and how it ensures consistency in both single‑node and multi‑node distributed systems for modern cloud‑native applications.
RaftKeeper is an open‑source, C++‑implemented Raft‑based distributed consensus service that offers double‑the‑throughput, sub‑second latency, five‑nines availability, and full ZooKeeper compatibility, targeting high‑performance OLAP workloads and large‑scale backend scenarios.
The article explains how Paxos can be generalized by defining its round number (rnd) over any partially ordered set, enabling both forced and non‑forced conflict exclusion mechanisms similar to 2PC, and showing how this expands Paxos’s applicability to multi‑dimensional transaction ordering and simplifies distributed database architectures.
This article explains how transactions, consistency, and consensus interrelate in distributed systems, reviews replication models, details ACID properties, internal consistency models, consensus algorithms, and Kafka’s configuration and transaction support, and highlights verification tools like TLA+ and Jepsen for ensuring correctness.
The article explains Web3’s trust‑less model and smart‑contract fundamentals—from Bitcoin’s simple script to Ethereum’s gas‑metered EVM—examines design trade‑offs such as on‑chain versus signature‑based whitelists, outlines engineering practices for immutable bytecode upgrades, and describes consensus evolution from PoW to a hybrid PoS/PoA PBFT “High‑Energy Chain.”
The article explains how establishing team consensus on the purpose and baseline of retrospectives, understanding the two main retrospective approaches, and equally analyzing both strengths and weaknesses while focusing on key factors and deep analysis can prevent blame culture and improve learning outcomes.
This article presents abstract‑paxos, a unified framework that derives Paxos and Raft from first principles, defines information certainty, quorum, and a total order on states using commit_index, and details a two‑phase protocol, member‑change handling, and how the model maps to classic Paxos and Raft implementations.
This article explains Zookeeper's ZAB (Zookeeper Atomic Broadcast) protocol, detailing node roles, the leader election process during startup and failure, the two‑phase commit data synchronization, ordering guarantees, and scenarios of leader crash and data loss, providing clear diagrams and code examples.
This article explains the concept of consensus in blockchain, compares private, consortium and public environments, and introduces key algorithms such as Paxos, Raft, PBFT, Proof‑of‑Work and Proof‑of‑Stake, highlighting their challenges and solutions.
The article explains consistency concepts in distributed systems—including strong and weak (eventual) consistency, CAP and FLP theorems, and key protocols such as 2PC, 3PC, and Paxos—detailing their mechanisms, advantages, and challenges.
This article compares common distributed transaction approaches—including Master‑Slave, Master‑Master, two‑phase and three‑phase commit, and Paxos—explains their mechanisms, trade‑offs, and real‑world implementations such as Alibaba’s TCC, GTS, LCN, and TXC, helping architects select the most suitable solution for high‑availability data consistency.
This article introduces core concepts of distributed systems, including node and replica models, various consistency levels, data distribution strategies, lease and quorum mechanisms, replica control protocols such as primary‑secondary, two‑phase commit, MVCC, Paxos, and the CAP theorem, providing a comprehensive overview for architects.
This article examines the challenges of Raft’s two‑stage Joint Consensus member changes, explores single‑step alternatives, analyzes ZooKeeper’s approach, and proposes improvements that combine safety with reduced log overhead, offering practical insights for distributed system engineers seeking more efficient reconfiguration methods.
This article explains the challenges of distributed consistency in decentralized environments and provides an in‑depth overview of classic consensus algorithms such as PBFT, Proof‑of‑Work, and Proof‑of‑Stake, including their mechanisms, limitations, and suitable application scenarios.
This article explains the core mechanisms of the Raft consensus algorithm—including leader election, log replication, safety guarantees, message structures, state transitions, and key Go implementations in etcd-raft—providing code examples and detailed analysis of functions such as becomeLeader, tickElection, and appendEntry.
This article explains how Kafka is moving away from ZooKeeper by introducing the KRaft protocol, describing the Controller Quorum mechanism, Raft‑style state machine, message types, leader election, metadata log replication, and safety guarantees in a distributed system.
This article provides a comprehensive overview of distributed system fundamentals, covering node models, replica concepts, various consistency levels, data distribution strategies, lease-based caching, quorum mechanisms, two‑phase commit, MVCC, Paxos consensus, and the CAP theorem, illustrating each with practical examples and diagrams.
This article provides a comprehensive overview of Zookeeper, covering its purpose, cluster roles, Znode types, session handling, watcher mechanism, ACL permissions, common use cases, data consistency via the ZAB protocol, leader election, synchronization methods, potential inconsistency scenarios, and a comparison with other service‑registry solutions.
This article provides a comprehensive overview of Polkadot, explaining its relay‑chain and parachain architecture, cross‑chain interoperability goals, detailed transaction lifecycle across five stages, the nominated proof‑of‑stake (NPoS) consensus mechanism, and the growing ecosystem of applications built on the platform.
This article provides a comprehensive overview of the Raft consensus algorithm, detailing node roles (follower, candidate, leader), the leader election process, mechanisms ensuring cluster consistency, handling of node failures, and strategies for resolving split‑brain scenarios in distributed systems.
This article provides a comprehensive overview of distributed system fundamentals, covering core concepts such as nodes, replicas, consistency models, data distribution strategies, lease and quorum mechanisms, two‑phase commit, MVCC, Paxos, and the CAP theorem, along with practical considerations for designing robust, scalable services.
This comprehensive guide explores the core concepts of distributed systems, covering node models, replica strategies, consistency levels, data distribution techniques, lease-based caching, quorum mechanisms, logging, two‑phase commit, MVCC, Paxos consensus, and the CAP theorem, providing practical insights for building robust scalable architectures.
This article provides a comprehensive overview of distributed system fundamentals, covering system models, replica concepts, consistency levels, performance metrics, data distribution strategies, basic replica protocols, lease mechanisms, quorum, logging, MVCC, Paxos, and the CAP theorem.
This article uses animated diagrams to explain the Raft consensus algorithm, covering its overview, roles, single‑node and multi‑node scenarios, leader election process, term handling, election rules, heartbeat timeouts, and leader failure recovery, helping readers grasp distributed consistency fundamentals.
This article explains the Paxos consensus algorithm by mapping its roles and phases to characters and events from the Three Kingdoms era, detailing the Prepare and Accept stages, proposal numbering, and how proposers, acceptors, and learners achieve fault‑tolerant agreement in distributed systems.
This article provides a comprehensive overview of ZooKeeper, covering its purpose as a distributed coordination service, design goals, hierarchical data model, session handling, watch mechanism, consistency guarantees, server roles, leader election, workflow of leaders and followers, and the Zab protocol that ensures reliable state replication.
This article explores EOS as a leading Blockchain 3.0 platform, detailing its layered architecture, consensus mechanisms, resource management model, account system, smart contract framework, and how Suning leverages EOS for a scalable distributed data storage solution.
Quorum, the core principle behind majority read/write and Paxos, can be defined in various ways—including weighted, hierarchical, and non‑majority quorums—to trade off system availability, latency, and fault tolerance, with examples illustrating how different quorum designs affect performance in distributed storage and coordination services.
JD Digits' JACOBI Blockchain Innovation Lab unveiled a series of breakthrough research results—such as the Dumbo and Dumbo‑MVBA asynchronous consensus protocols, a blockchain identity management scheme, and a storage‑time proof—demonstrating leading academic contributions across consensus, cryptography, and distributed applications.
This article surveys major blockchain consensus mechanisms—including Byzantine Fault Tolerance, Proof of Work, Proof of Stake, Delegated Proof of Stake, Practical BFT, Paxos, and Raft—detailing their principles, workflows, advantages, and challenges, and illustrates how they underpin distributed ledger security and performance.
This comprehensive article explains the core concepts of distributed systems—including node modeling, failure types, replica strategies, consistency levels, performance metrics, data distribution techniques, lease mechanisms, quorum, logging, two‑phase commit, MVCC, Paxos, and the CAP theorem—providing a solid foundation for designing robust, scalable architectures.
This article explains what ZooKeeper is, why it was created, its core features such as high performance, high availability, and consistency, and how it simplifies distributed application development by providing coordination services like naming, locks, leader election, and configuration management.
This article explains what ZooKeeper is, why it was created, its key features such as high performance, high availability, and strong consistency, and how it simplifies distributed application development by providing coordination primitives like naming, locks, leader election, and configuration management.
The article explains blockchain as a decentralized, tamper‑proof distributed ledger built from a peer‑to‑peer network, block structure, consensus, cryptography and smart contracts, outlines its evolution from information to value internet, classifies public, consortium and private chains, and details Tencent Cloud’s BaaS platform, Zhixin Chain evidence services, and various technical solutions and use‑cases such as data integrity, supply‑chain traceability and asset tokenization.
ByteKV is a C++-based, strongly consistent, range-partitioned key‑value storage system built by ByteDance, featuring a multi‑Raft consensus layer, custom storage engines (RocksDB and BlockDB), automatic partition splitting/merging, load balancing, distributed transactions, and a SQL table layer for rich data models.
This article provides an in‑depth introduction to Apache ZooKeeper, covering its role in distributed systems, core concepts such as ZNodes, watches, consensus via the ZAB protocol, deployment modes, configuration parameters, common CLI commands, and typical application scenarios like naming services, configuration management, leader election, and distributed locking.
This article provides a clear, beginner‑friendly explanation of blockchain technology, covering its nature as a decentralized distributed database, the structure of blocks and hashes, the mining process with difficulty adjustment, and how forks are resolved, while highlighting its advantages and limitations.
This article explains how to extend a Go implementation of the Raft consensus algorithm to handle client commands, replicate logs across the cluster, manage commit pipelines, and ensure election safety, while providing detailed code examples and discussion of underlying concepts.
This article, the second in a series on Raft, explains the election mechanism, server states, timers, RPC handling, and partition scenarios while providing complete Go code examples for the consensus module and its interactions.
The article explains the “ghost replay” problem—an inconsistency arising from the third state of distributed requests—and examines how consensus protocols such as Paxos, Multi‑Paxos, Raft, and ZAB address it through epoch IDs, noop entries, and leader election rules to prevent duplicate log entries.
This article explains the CAP theorem, illustrates the Byzantine Generals problem, and provides detailed overviews of PBFT, Paxos (including Multi‑Paxos), and Raft consensus algorithms, highlighting their phases, roles, and practical considerations for achieving consistency in distributed systems.
The article examines the shared and divergent aspects of blockchain and databases, outlining three ideal blockchain scenarios, comparing transaction management, consensus algorithms, and programming paradigms, and exploring performance, multi-version control, and future integration possibilities between the two technologies.
This article provides a detailed explanation of ZooKeeper, covering its purpose as a distributed coordination service, its file‑system‑like namespace, node types, watch mechanism, leader election, data replication, synchronization protocols, and common use cases such as distributed locks, queues, and configuration management.
This tutorial explains blockchain fundamentals, its decentralized and tamper‑proof nature, and walks through a complete Java implementation—including block structure, hash calculation, mining, validation, and testing—while also covering advanced topics such as consensus algorithms, transaction verification, node types, real‑world applications, and essential development tools.
This article explores the two toughest problems in distributed stream processing—exactly‑once message handling and ordering—by dissecting the underlying impossibility of perfect failure detectors, the liveness‑vs‑safety trade‑off, zombie processes, and the practical solutions employed by systems such as Flink, Kafka Streams, MillWheel, and Spark.
This article provides a comprehensive overview of distributed‑system fundamentals, covering node concepts, failure types, replication models, consistency levels, performance and availability metrics, data‑distribution strategies, replica control protocols, lease mechanisms, quorum, two‑phase commit, MVCC, Paxos, and the CAP theorem.
The article explains the concept of transparent scalable NewSQL databases, discusses the historical challenges of scaling relational systems, and details the design and implementation techniques—such as dynamic sharding, distributed transactions, consensus algorithms, distributed SQL, and CB‑SQL’s specific mechanisms like HLC, SSI isolation, Multi‑Raft, and automatic load balancing—to achieve elasticity, high availability, and seamless scalability.
JD Chain, JD Digital Technology’s open‑source blockchain engine announced in 2019, offers enterprise‑grade features such as modular cryptographic algorithms, pluggable consensus protocols, key‑value ledger model, flexible storage, and comprehensive APIs, aiming to accelerate blockchain adoption across diverse business scenarios.
This article explains the ZAB protocol—Zookeeper's atomic broadcast and crash‑recovery mechanism—detailing its design, message‑broadcast process, leader election, transaction ordering with ZXID, and how it ensures data consistency and availability in distributed systems.
This article explains how to augment Hyperledger Fabric's orderer service by integrating Tendermint's ABCI to implement a PBFT consensus mechanism, detailing the limitations of solo and Kafka ordering, the motivation for decentralized ordering, and the step‑by‑step implementation approach.
This article surveys thirty major blockchain and DAG consensus algorithms, detailing each method's advantages, disadvantages, typical users, and classification, while explaining how these mechanisms underpin decentralized trust and security across distributed ledger platforms.
This article surveys multiple double‑spend attack vectors discovered on major public blockchains such as Bitcoin, EOS, and NEO, classifies them into verification flaws, VM execution inconsistencies, and consensus weaknesses, and proposes an efficient mitigation method based on write‑operation hashing.
This tutorial walks through building a simple blockchain in Java, covering core concepts, block and transaction structures, proof‑of‑work implementation, and exposing API endpoints via Servlets for creating transactions, mining blocks, viewing the chain, and achieving consensus across nodes.
This comprehensive guide walks developers through the fundamental principles of blockchain, covering monetary trust, cryptographic primitives, Bitcoin's transaction model, block structure, proof‑of‑work mining, security challenges, alternative consensus mechanisms, and real‑world applications beyond cryptocurrency.
This article explains Ethereum's core modules, transaction flow, account and UTXO models, state storage using Merkle‑Patricia tries, synchronization modes, and details Meitu's delegated proof‑of‑stake (DPoS) design, including its additional global state trees and practical deployment considerations.
Tendermint is a modular blockchain framework that separates consensus (a Byzantine‑fault‑tolerant Proof‑of‑Stake engine) from application logic via the ABCI, offering a three‑layer architecture—networking, consensus, and application—so developers can build custom chains in any language while leveraging Cosmos interoperability.
The article recaps the 2018 UCan afternoon tea, covering NEM’s multisignature technology, UCloud’s trusted blockchain data‑flow solution using Intel SGX, virtual‑currency security challenges, HPB’s hardware‑accelerated blockchain architecture, and Genaro Network’s hybrid consensus with SPoR, offering practical insights for developers seeking secure and high‑performance blockchain implementations.
Telegram’s open‑source TON blockchain combines a master chain with dynamically sharded work chains, uses hyper‑cube routing for fast or reliable inter‑shard messages, employs PoS‑BFT consensus with validators, nominators and fishermen, supports services like DNS, Proxy, Storage and Pay, and manages a 5‑billion Gram token economy to enable scalable decentralized applications.
The article introduces blockchain fundamentals for programmers, covering asymmetric cryptography, public ledgers, double‑spending, transaction ordering, consensus mechanisms, proof‑of‑work mining, smart contracts, gas, token transfers, zero‑knowledge proofs, and self‑regulation, while relating each concept to familiar software engineering patterns.
This article explains Zookeeper's leader election mechanism, covering server identifiers, election states, vote structures, the two types of leader elections, the FastLeaderElection algorithm, quorum calculation, and the underlying network and queue components that enable reliable distributed consensus.
This article explains the fundamentals of Raft and PBFT consensus algorithms, compares their processes, fault tolerance limits, and suitability for private and consortium blockchains, and highlights key differences in leader election, message handling, and fault models.
This article explains Bitcoin's transaction‑packaging process, the step‑by‑step mining workflow, the causes of blockchain forks—including both natural and intentional splits—and the criteria used to select the best chain as the main chain, providing a comprehensive technical overview.
This tutorial explains the fundamentals of Proof‑of‑Stake, compares it with Proof‑of‑Work, and provides a step‑by‑step Go implementation of a PoS blockchain with TCP networking, validator selection, and code snippets for building and running the system.
This article combines humorous blockchain anecdotes with a clear, illustrated explanation of blockchain fundamentals and a complete Python tutorial that walks you through creating a blockchain, implementing proof‑of‑work, exposing it via Flask APIs, and handling node consensus.
This article explains the detailed process of Bitcoin transaction packaging, the steps miners follow to create new blocks, and how both natural and intentional blockchain forks arise, including the criteria for selecting the best chain and the differences between hard and soft forks.
This article examines core distributed system design principles—reliability, scalability, and maintainability—explaining how techniques such as replication, partitioning, consensus algorithms, and transactions address hardware, software, and human failures, and discusses vertical and horizontal scaling strategies to achieve robust, extensible, and maintainable architectures.
Hyperledger Fabric, an open‑source blockchain framework from the Linux Foundation, provides immutable ledgers, consensus mechanisms, and identity management to address trust challenges in scenarios like inter‑bank settlement and supply‑chain finance, detailing its data structures, modules, transaction flow, and core services.
This article explains the core technical concepts of blockchain—including encrypted data relationships, immutability, peer-to-peer networks, blocks, mining, consensus mechanisms, Merkle trees—and discusses suitable and unsuitable use cases, typical applications such as Bitcoin and Ethereum, and practical considerations for developers.
This article explains what blockchain is, classifies public, consortium and private blockchains, describes block anatomy including headers and bodies, introduces the genesis block, outlines what can be stored in blocks, and provides a detailed breakdown of Bitcoin's block structure and fields.
This article explains how Bitcoin implements a decentralized electronic currency system by combining P2P networking, blockchain ledger structures, cryptographic signatures, proof‑of‑work consensus, and final consistency to achieve secure, tamper‑resistant storage and transaction processing.
This article translates a concise three‑step tutorial that explains blockchain’s core components—the ledger itself, the peer‑to‑peer network, and consensus mechanisms—while illustrating how these elements work together to secure and validate transactions.
Learn how to build a functional blockchain in Python using Flask, covering environment setup, the core Blockchain class, block and transaction structures, a simple proof‑of‑work algorithm, RESTful API endpoints, node registration, and a longest‑chain consensus mechanism, complete with runnable code examples.
This article examines blockchain's core mechanisms, its influence on system architecture—including tight coupling, security, privacy, and consensus challenges—and presents China Merchants Bank's practical implementation of a blockchain‑based cross‑border clearing system.
This article explores blockchain fundamentals, its classification, core mechanisms such as decentralization, public‑key cryptography and consensus, examines how blockchain reshapes system architecture and introduces challenges like security, privacy, and smart‑contract legality, and details China Merchants Bank’s practical implementation of a blockchain‑based cross‑border clearing platform.
This article explains the fundamental concepts of blockchain—including distributed storage, peer‑to‑peer transmission, consensus mechanisms and cryptography—illustrates its advantages such as cost reduction and transparency, compares it with cloud computing, and discusses its impact across industries while noting upcoming events.
This article presents a side‑by‑side comparison of three major blockchain platforms—Bitcoin, Ethereum, and Hyperledger Fabric—detailing their required cryptocurrencies, network types, permission models, consensus algorithms, smart‑contract support, and primary programming languages, and typical use cases.
This article introduces the origin and key alliances of blockchain, explains its core characteristics such as decentralization, consensus mechanisms and transaction transparency, and provides a detailed description of the Merkle Tree algorithm, its implementation, verification steps, and applications in distributed file synchronization.
This article uses a simple village story to explain Bitcoin’s origins, the transition from barter to commodity and fiat money, the creation of a decentralized virtual currency, the roles of miners, transaction verification, and the security mechanisms that keep the network trustworthy.
This article explains why Paxos is needed for distributed consistency, describes its three roles and phases, illustrates the protocol with a real‑world analogy, and shows how Paxos‑based log replication can provide strong, fault‑tolerant high‑availability for databases.
This article uses a vivid island metaphor to break down the Paxos consensus algorithm, maps its concepts to Zookeeper components such as servers, leaders, and Zxid, and illustrates conflict resolution and leader election through clear examples and diagrams.
This article explains how distributed systems balance consistency, availability, and performance by covering consensus algorithms like Paxos, replication models such as Master‑Slave and Master‑Master, and Amazon Dynamo’s N‑R‑W and Vector Clock approaches, while illustrating the CAP theorem trade‑offs.
In this interview, blockchain specialist Zou Jun defines blockchain as an immutable, append‑only distributed ledger, explains its technical foundations, compares it with traditional databases, discusses public, consortium and private chain use cases, security concerns, and future prospects beyond finance.
This article explains the fundamentals of consensus in distributed systems, compares Paxos and Raft, and provides a step‑by‑step guide with code snippets on embedding the etcd/raft library into the open‑source Mesos scheduler Swan to achieve reliable multi‑node data synchronization.
This article provides an in‑depth exploration of distributed consensus protocols, detailing the basics of Paxos, extending to Multi‑Paxos, and comparing it with Raft and Zab while discussing leader election, quorum, lease mechanisms, and practical considerations for implementing these algorithms in real‑world systems.
This article introduces core distributed‑system concepts—including the definition of consensus, the two‑phase and three‑phase commit protocols, the CAP theorem and its engineering implications, and logical‑clock mechanisms such as Lamport timestamps, vector clocks, and version vectors—explaining their models, challenges, and practical trade‑offs.
This article reviews the evolution of distributed locking—from simple MySQL table locks to Redis cache locks and the Redlock algorithm—examines expert criticisms of Redlock’s correctness, presents the Redis author’s rebuttal, and ultimately recommends Zookeeper as a more reliable solution for high‑availability distributed locks.
This article provides a comprehensive overview of Hyperledger Fabric’s architecture, detailing its three core components, key terminology, protobuf definitions for transactions, blocks and messages, chaincode development in Go, and proposed role‑based redesign for improved scalability.
