Blockchain Papers

Jincheng Zhang

This paper proposes a novel decentralized consensus protocol utilizing a cellular automaton (CA) as the proof-of-work (PoW) mechanism. Traditional blockchain-based PoW systems rely heavily on computationally intensive cryptographic hash functions, resulting in significant energy consumption and scalability limitations. This research introduces a fundamentally different approach, leveraging the inherent parallelism and computational simplicity of CA systems to achieve distributed agreement. The core mechanism involves nodes collaboratively evolving a CA, with computation occurring through local rule updates. The difficulty of achieving a predefined CA state, representing a block, is dynamically adjusted based on network participation, creating a more energy-efficient and scalable PoW solution. This approach moves beyond cryptographic hashing, offering a potentially transformative method for decentralized consensus in resource-constrained environments. The paper details the theoretical framework, outlines the proposed protocol, and discusses its potential benefits and challenges. Key performance indicators, such as block generation rate and energy consumption, are analyzed, demonstrating the protocol's efficiency compared to traditional PoW systems.

Jincheng Zhang

Blockchain consensus protocols are complex systems requiring rigorous formal analysis to ensure security, reliability, and efficiency. Traditional methods for formal specification, often relying on state machines and temporal logic, frequently result in overly complex and difficult-to-manage specifications. This paper proposes a novel approach utilizing category theory to provide a more concise, elegant, and ultimately more powerful framework for specifying these protocols. We demonstrate how the inherent structural relationships within consensus protocols—the interactions between nodes, the propagation of messages, and the agreement on states—can be naturally represented and analyzed through category theory concepts such as objects, morphisms, and functors. This approach allows for a higher level of abstraction, facilitating a clearer understanding of the protocol's behavior and enabling more effective verification and validation. The key benefits of this method include reduced specification complexity, improved expressiveness, and enhanced modularity. We present a concrete example of applying category theory to the specification of a simplified Practical Byzantine Fault Tolerance (PBFT) protocol, highlighting the advantages of this new perspective.

Jincheng Zhang

Blockchain technology has garnered significant attention for its potential to revolutionize various industries. A critical component of blockchain is its consensus mechanism, which ensures the integrity and reliability of the distributed ledger. However, current blockchain consensus protocols are frequently characterized by their complexity, making formal verification challenging. This paper addresses this challenge by presenting a formal model of a blockchain consensus protocol using process calculi. Specifically, we utilize the Temporal Temporal Calculus (TCC) formalism to represent the protocol's state transitions and interactions. This approach allows for a rigorous analysis of the protocol's correctness, security, and efficiency. The model captures key aspects such as node participation, transaction validation, and block creation. The use of process calculi offers a precise and unambiguous description of the protocol, facilitating the identification and mitigation of potential vulnerabilities. This work contributes to a foundational understanding of blockchain consensus and paves the way for improved protocol design and enhanced security assurances.

Jincheng Zhang

This paper presents a novel approach to zero-knowledge proof (ZKP) systems that dynamically generate and verify proofs in real-time, eliminating the need for pre-storage of complete proof data. The core mechanism leverages verifiable hash functions and verifiable computation circuits to enable dynamic proof generation and validation. This addresses the limitations of traditional ZKPs regarding large proof sizes and low generation efficiency, offering new security guarantees for large-scale distributed computations. The proposed system significantly reduces the storage requirements and computational overhead associated with ZKP systems, paving the way for more efficient and scalable cryptographic protocols. This work details the architecture, algorithms, and theoretical underpinnings of this dynamic ZKP system, highlighting its advantages and potential applications.

Miaosheng Wang

PRE-GHR XXXIX v5.0 (2026-08-28) — release version closing all six objections of an adversarial pre-submission review. PRE-GHR XXXVIII gave the series its first formal definition of the irreducible governance residue δ0μ(P) := inf over admissible P' of ||residue(P')|| and proved a bit-level lower bound. This paper builds the property theory. The mathematics is a domain-order theory: every inequality follows from how the admissible domain D(P) behaves under enlargement or composition of protocols. We prove monotonicity of δ0μ in the erasure surface, an exact composition law δ0μ(P1 ∘ P2) = δ0μ(P1) + δ0μ(P2) − |T(P1) ∩ T(P2)| under explicit hypotheses (segment autonomy, joint attainability, cross-segment cleanliness), and positivity δ0μ(P) > 0 whenever T(P) is non-empty as a purely normative fact, with Landauer's principle confined to the physical interpretation. We then ask what a running system's audit ledgers can measure. The answer is stratified: the ordering structure is measurable in principle — conditional on a fixed normalization and full retention — while the absolute value is stated relative to a fixed code-point measure, and the aggregate-to-single-protocol bridge remains open. No interception statistic is claimed to equal δ0μ; where the wall cannot be built, the gap is marked, not papered over. Changes in v5.0 (six revision tickets, R01–R06, each closing one reviewer objection): R01 — Theorem 4 unilateralized: the safe direction (T(P) non-empty ⇒ δ0μ > 0) remains a theorem; the converse is demoted to Observation 4.1 under an explicit complete-erasure assumption. A witness-reading remark records that δ0μ is a minimum witness cardinality in the sense of why-provenance, inherited and not claimed as new. R02 — ledger counts restricted to lower witnesses only: the ordering claim is measurable solely under a fixed normalization and full retention, stated as an explicit condition rather than an implicit assumption. R03 — the uniform-sampling remark now carries an explicit finite-sample bound (Hoeffding's inequality in its standard form), two-sided: “holds in expectation” is no longer used as if it held for a sample. R04 — four empirical mappings corrected: schema-field disjointness is separated from retained-trace intersection; the approximate join reports both false-negative and false-positive error (the earlier “directionally safe, never over-counting” claim is withdrawn); the overlap-error direction is declared two-sided and governed by an error budget rather than assumed away; and the retention ratio is restated as an interception-event ratio in matched units. R05 — measure-relative notation throughout: bits and code points are two measures on one trace universe, so every ordering claim is stated at a fixed μ and changing μ defines a new quantity rather than restating the old one. R06 — subject classification reassessed and Related Work rebuilt. The paper contains no multiagent model and no coordinated-interaction result; the earlier cs.MA classification is withdrawn as unsupported by the technical content, and the classification adopted here is cs.CR primary with cs.DB cross-list. Related Work now separates the lineage the paper inherits from — linked timestamping and distributed witnesses (Haber & Stornetta 1991; Bayer, Haber & Stornetta 1993), split-view detection and the undefined gossip layer (Certificate Transparency, RFC 6962 / RFC 9162), existence-not-authenticity timestamping (OpenTimestamps), provenance and lineage (W3C PROV; Buneman, Khanna & Tan 2001; Cui, Widom & Wiener 2000), record linkage (Fellegi & Sunter 1969), trace semantics (Hoare 1978; Brookes, Hoare & Roscoe 1984), and measure and order (Halmos; Davey & Priestley) — from adjacent recent lines cited for comparison only. Where a construction of this paper rediscovers an existing one, priority is assigned to the source and no originality is claimed. Honesty notes. Citations to Hoeffding, Fellegi & Sunter, Halmos, Davey & Priestley and the CSP literature are made at the level of the standard statement of each framework only, pending full-text verification. Two candidate references were deliberately excluded because their primary sources could not be verified. Two gaps are inherited rather than closed: the hash-chain anchor has no consistency-proof comparison mechanism, and the anchor-propagation (gossip) layer is undefined in the source standard as well. Open questions Q5.1, Q5.3 and Q5.4 remain declared open.

Jincheng Zhang

This paper presents a novel approach to achieving both strong differential privacy guarantees and Byzantine fault tolerance (BFT) in distributed systems. The core of the system leverages a verifiable random function (VRF) based consensus protocol built upon a Byzantine fault-tolerant distributed ledger. This architecture effectively addresses the inherent challenges of protecting sensitive data while maintaining system availability and data integrity even in the presence of malicious actors. The system utilizes VRF to mask computation results, providing differential privacy, and the distributed ledger to ensure robustness against Byzantine attacks. The key innovation lies in the verifiable and layered design, offering a rigorous framework for combining these two traditionally disparate goals. We demonstrate a theoretical framework for the system's operation, outlining the protocols involved and the mathematical properties utilized to guarantee both privacy and fault tolerance. The system achieves a privacy parameter ε and a fault tolerance threshold τ, where ε controls the privacy loss and τ represents the level of Byzantine fault tolerance. The system's architecture is designed to be adaptable to various distributed applications, offering a robust solution for sensitive data processing in challenging environments.

Jincheng Zhang

Consensus algorithms are fundamental to the operation of distributed systems, underpinning applications ranging from blockchain technology to distributed databases. However, ensuring the correctness and resilience of these algorithms remains a significant challenge. This paper presents a novel approach to formally verifying consensus algorithms using distributed simulation. We propose a framework that allows for the emulation of a consensus algorithm on a distributed network, facilitating the detection of potential vulnerabilities and failures before deployment. The core of our method involves systematically simulating the algorithm under various failure scenarios, capturing the algorithm's behavior and identifying deviations from expected outcomes. This approach offers a practical and scalable solution for verifying consensus algorithms in real-world distributed systems, contributing to increased system reliability and security. The simulation framework utilizes the following key elements: a model of the consensus algorithm, a distributed network simulator, and a verification engine that analyzes the simulation results. We demonstrate the feasibility and effectiveness of our method through a detailed example, highlighting its potential for broad application in the verification of diverse consensus algorithms.

Jincheng Zhang

Distributed consensus algorithms are fundamental to many critical systems, including blockchain networks, sensor networks, and distributed databases. However, these systems are vulnerable to Byzantine faults, where malicious nodes can arbitrarily deviate from the agreed-upon protocol. Verifying the convergence and correctness of consensus algorithms under these conditions is a notoriously difficult problem. This paper presents a novel approach to probabilistic formal verification of distributed consensus algorithms with Byzantine fault tolerance. We model the consensus algorithm as a stochastic process and leverage probability covers and Markov chain analysis to derive rigorous proofs of convergence and fault tolerance. This method allows us to quantify the probability of correct operation even in the presence of arbitrary malicious behavior, offering a significant advancement over traditional approaches that often rely on idealized assumptions. The key contribution lies in the ability to provide probabilistic guarantees for consensus algorithm behavior, rather than simply demonstrating eventual convergence. We illustrate the application of this framework with a simplified example, highlighting its potential for scaling to more complex consensus protocols.

Jincheng Zhang

This paper presents a novel distributed consensus algorithm designed for commodity networks, specifically focusing on achieving Byzantine fault tolerance. Existing consensus algorithms frequently suffer from complexity and high resource requirements, limiting their applicability in real-world scenarios where network conditions and potential malicious activity are significant concerns. This algorithm addresses these limitations by utilizing the inherent capabilities of commodity networks—such as the Internet—to facilitate distributed agreement. A core mechanism is the incorporation of Byzantine fault tolerance techniques, ensuring that the system can maintain agreement even when a fraction of the nodes are compromised and actively attempting to disrupt the consensus process. The proposed algorithm prioritizes simplicity and efficiency, aiming for accessibility on everyday networks while robustly handling potential attacks. The design emphasizes a probabilistic approach to fault detection and recovery, coupled with a novel voting scheme, to achieve both efficiency and resilience. This work aims to broaden the applicability of consensus mechanisms beyond specialized blockchain systems to a wider range of distributed applications.

Jincheng Zhang

Distributed consensus algorithms are fundamental to many modern systems, including blockchain networks, sensor networks, and cloud computing platforms. However, ensuring the correctness of these algorithms in the face of network failures, message delays, and other unpredictable events is a significant challenge. This paper proposes a novel approach to formally verify distributed consensus algorithms using temporal logic and model checking. We define the desired properties of the algorithm using temporal logic formulas, which express requirements such as safety (agreement) and liveness (eventual agreement). Subsequently, we employ model checking techniques to systematically explore the state space of the algorithm and determine whether it satisfies these temporal logic properties under various network conditions. The core idea is to provide a rigorous method for guaranteeing algorithm correctness and robustness, moving beyond traditional testing methods that often rely on exhaustive testing or probabilistic guarantees. The approach offers a quantifiable assurance level, crucial for deploying these algorithms in critical applications.

Jincheng Zhang

Concurrent distributed algorithms are crucial for modern applications like cloud computing, IoT, and blockchain, but their verification presents significant challenges. Traditional testing methods often fail to uncover subtle errors related to race conditions and inconsistent states. This paper proposes a novel framework for formally verifying these algorithms using temporal logic, specifically Linear Temporal Logic (LTL). The framework focuses on precisely specifying algorithm behavior through LTL formulas and automatically checking these formulas against simulations of the distributed system. The core contribution lies in the development of an automated tool that translates high-level algorithm descriptions into LTL specifications and executes these specifications within a distributed simulation environment. We demonstrate the effectiveness of this approach by applying it to a simplified consensus algorithm, showcasing the ability to detect potential vulnerabilities that would be missed by conventional testing. The results highlight the potential of formal verification to dramatically improve the reliability and security of concurrent distributed systems.

Jincheng Zhang

This paper proposes a novel decentralized consensus algorithm designed to achieve Byzantine fault tolerance while simultaneously incorporating differential privacy mechanisms. The core idea is to leverage a blockchain-inspired architecture for transaction validation and agreement, enhanced with encrypted transactions and a randomized consensus protocol. Crucially, noise is injected into the consensus process to obscure individual contributions, thereby satisfying differential privacy constraints. The algorithm addresses the critical challenge of combining security and privacy in distributed systems, offering a robust solution for applications requiring both data integrity and user privacy protection. We formally define the algorithm, outlining the key components and their interactions, and analyze its properties regarding fault tolerance, privacy guarantees, and performance. The approach represents a significant step towards practical decentralized systems capable of handling malicious actors while respecting individual user data. The presented framework provides a foundation for future research and development in this increasingly important area.

Jincheng Zhang

Decentralized consensus algorithms are the foundation of blockchain technology, enabling trustless and secure distributed systems. However, verifying the correctness and security of these algorithms is a formidable challenge due to their inherent complexity, distributed nature, and susceptibility to various failure modes, notably Byzantine faults. This paper proposes a novel approach utilizing abstract interpretation techniques to provide a rigorous and mathematically sound method for formal verification. We leverage techniques like interval analysis and linear arithmetic to construct abstract models of consensus protocols. These models allow us to formally verify crucial properties such as liveness (guaranteeing eventual agreement), safety (preventing incorrect states), and resilience to Byzantine failures. The approach offers a significant advancement over traditional testing and simulation methods, providing a higher degree of confidence in the reliability and security of decentralized consensus algorithms. The core contribution lies in the systematic application of abstract interpretation to model and verify complex, distributed systems, offering a pathway to robust and trustworthy blockchain implementations.

Jincheng Zhang

This paper proposes a novel decentralized blockchain verification system utilizing distributed Bayesian Networks (BNs). Traditional blockchain verification relies heavily on cryptographic proofs, which can be computationally intensive and susceptible to specialized attacks. Our approach offers a probabilistic and decentralized alternative. Each node maintains a Bayesian Network representing the blockchain's transaction graph, continuously updated with observed transactions. Consensus is achieved through iterative Bayesian inference and probabilistic agreement on the validity of new transactions. This system mitigates single points of failure, enhances security through probabilistic reasoning, and provides a more scalable verification process compared to traditional methods. The core claim is that a decentralized blockchain verification system can be built by leveraging distributed Bayesian Networks to model and verify transaction dependencies. The core mechanism involves continuous BN updates and consensus through iterative inference. This paper outlines the system architecture, the probabilistic inference process, and discusses potential applications and future research directions.

Jincheng Zhang

Blockchain technology relies heavily on consensus protocols to ensure data integrity and security. However, the decentralized and often complex nature of these protocols makes formal analysis and design challenging. This paper proposes a novel approach to formally specifying and analyzing blockchain consensus protocols using game theory. We model the consensus process as a strategic game, considering the incentives of different participants and deriving the resulting equilibria. This framework allows for a rigorous assessment of protocol design, identifying vulnerabilities and potentially optimizing performance. The core claim is that game theory provides a viable tool for both designing and analyzing blockchain consensus protocols. We explore various consensus mechanisms, including Proof-of-Work and Proof-of-Stake, demonstrating the application of our method. The key contribution is a theoretical framework offering a systematic approach to blockchain consensus design, moving beyond intuitive assumptions and enabling a more robust and secure system.

Jincheng Zhang

Blockchain technology's core functionality relies heavily on consensus algorithms to maintain data integrity and security. However, the complexity inherent in these algorithms introduces significant potential for errors and vulnerabilities. This paper proposes a formal verification approach utilizing model checking to rigorously assess the correctness and security of prominent blockchain consensus algorithms, including Proof-of-Work (PoW) and Proof-of-Stake (PoS). We define formal specifications of these algorithms and employ a model checker to explore all possible states and transitions, identifying potential bugs and ensuring adherence to protocol rules. The methodology presented offers a systematic and automated means of guaranteeing the reliability of blockchain systems, a critical step towards wider adoption and trust. This work focuses on the theoretical aspects of verification, providing a framework for future practical implementation and integration within blockchain development workflows. The key contributions are a detailed specification language for blockchain algorithms and a demonstrated application of model checking to uncover subtle vulnerabilities.

Jincheng Zhang

This paper proposes a novel decentralized verification protocol for distributed systems leveraging blockchain technology and cryptographic commitments. The core idea is to eliminate the need for a central authority by enabling components to independently verify each other's outputs through a trustless and auditable process. The system utilizes smart contracts on a blockchain to record component outputs and their corresponding commitments, establishing a verifiable record of the system's behavior. This approach offers a fundamentally new method for distributed systems security, addressing limitations inherent in traditional centralized verification models. The protocol's key components include commitment schemes, decentralized consensus mechanisms, and blockchain-based storage, all designed to ensure the integrity and authenticity of distributed system components. We outline the protocol's architecture, detailing the cryptographic operations and blockchain interactions involved. The resulting system provides a robust and scalable solution for verifying distributed systems, particularly in scenarios where trust is limited or absent.

Jincheng Zhang

This paper proposes a Blockchain-Based Distributed Data Verification System (BBDVS) designed to address the inherent trust issues present in traditional distributed data verification methods. The system leverages the core principles of blockchain technology – namely, its consensus mechanisms and immutability – to provide a secure, transparent, and verifiable record of data integrity. BBDVS utilizes a distributed ledger to maintain a chronological and tamper-proof audit trail of data transactions. Each transaction, representing a data verification event, is cryptographically linked to the previous one, forming a chain. The system employs a consensus mechanism to validate transactions and add them to the blockchain, ensuring data integrity and preventing malicious alterations. This approach eliminates the need for a central authority, reducing single points of failure and enhancing overall system resilience. The paper details the architecture and operational aspects of the BBDVS, focusing on the key components and their interactions. We explore the potential applications of the system across various domains where data integrity and trust are paramount.

Jincheng Zhang

This paper proposes a novel approach to mathematical proof verification utilizing blockchain technology and distributed consensus mechanisms. Traditional proof verification relies on centralized authorities, creating potential vulnerabilities related to trust, manipulation, and single points of failure. Our system addresses these concerns by representing proof steps as transactions on a blockchain. Consensus mechanisms, such as Proof-of-Work or Proof-of-Stake, are employed to validate and secure the proof process, ensuring its integrity and immutability. The core claim is that the correctness of mathematical proofs can be verified through a distributed system leveraging blockchain consensus mechanisms. This approach offers increased transparency, auditability, and resistance to fraud, fundamentally changing the landscape of mathematical verification. We detail the architecture, transaction structure, and consensus protocol design, outlining a robust framework for distributed proof verification. The system's potential impact extends beyond individual proofs, offering a foundation for collaborative mathematical research and a verifiable record of mathematical discoveries. We define the key mathematical components and the associated notations used throughout this document.

Jincheng Zhang

This paper proposes a novel approach to software version control leveraging the inherent properties of blockchain technology. Traditional version control systems suffer from centralized vulnerabilities and single points of failure, leading to potential data loss and compromised integrity. This system addresses these limitations by utilizing blockchain's immutable ledger and distributed storage capabilities. Each software code version is recorded as a transaction on the blockchain, secured by a consensus mechanism. This ensures a complete and verifiable history of code changes, dramatically enhancing security, reliability, and transparency compared to conventional methods. The core claim of this work is that the combination of blockchain's features provides a significantly more robust and trustworthy software version control solution. The system's design incorporates key mechanisms such as transaction hashing, smart contracts for version management, and a distributed consensus protocol to guarantee data integrity and consistency. The resulting architecture offers a compelling alternative for organizations seeking a secure and resilient software development environment.

Jincheng Zhang

This paper presents a novel approach to distributed constraint satisfaction (CS) algorithms by leveraging blockchain technology for verification. The core challenge in distributed CS lies in ensuring the correctness and reliability of the algorithms across multiple nodes. Existing solutions often rely on centralized trust models, which are vulnerable to manipulation and single points of failure. Our proposed system addresses this by employing a decentralized architecture where each node executes a CS algorithm, and the resulting solutions are cryptographically verified through a blockchain. This creates an immutable audit trail, guaranteeing the integrity of the process and fostering trust among participants. The system uses a distributed consensus mechanism to maintain the blockchain and ensures that any deviation from the expected solution will be flagged. This approach significantly enhances the security, reliability, and transparency of distributed CS, opening possibilities for applications in areas like smart grids, supply chain management, and decentralized autonomous organizations (DAOs). The key innovation resides in the combination of distributed computation with verifiable blockchain records, offering a robust and trustworthy solution for complex problem-solving scenarios.

Jincheng Zhang

This paper proposes a novel approach to blockchain consensus mechanisms by leveraging the principles of Distributed Proof Theory (DPT). DPT, traditionally applied to the analysis of distributed systems and formal verification, offers a rigorous mathematical framework for reasoning about logical consistency and correctness. We argue that mapping existing blockchain consensus protocols—such as Proof-of-Work, Proof-of-Stake, and Byzantine Fault Tolerance—onto the formal language of DPT allows for a deeper understanding of their vulnerabilities and facilitates the design of more secure and efficient algorithms. The core mechanism involves identifying and eliminating logical fallacies inherent in the consensus process, ultimately leading to a more robust and mathematically grounded design. This work presents a theoretical framework and outlines a methodology for applying DPT to blockchain, potentially leading to significant advancements in blockchain security, scalability, and overall reliability. The key contribution lies in the application of a sophisticated abstract mathematical theory to a practical problem within the blockchain domain, offering a unique perspective on the challenges inherent in decentralized consensus.

Arijit Das

No abstract is available for this record.

Kyrylo Sotnykov

Blockchain platforms enable transparent and immutable solutions for verification of proofs of digital claims, permissions, states, and events. However, numerous decentralized applications still force their users to operate with wallets, native tokens, and transaction costs, even though they have nothing to do with their verification purpose. This issue makes decentralized systems less user-friendly and constrains their adoption among not technically proficient Web3 users. This paper explores different patterns for gasless verification of proofs on decentralized platforms. The research focuses on five architectural patterns of such decentralized proof systems, including read-only blockchain verification, off-chain signature verification, relayer-based meta-transactions, account abstraction with paymasters, and hybrid on-chain/off-chain proof anchoring. Each architecture is analyzed qualitatively considering its usability, cost-effectiveness, decentralization, security, scalability, and implementation complexity. The results show that gasless verification enhances the usability of such systems, but at the same time transfers responsibility of trust assumptions to relayers, paymasters, backend servers, signature protocols, and off-chain data availability mechanisms. In this regard, potential risks, which include replay attacks, centralization of relayers, malicious paymaster activities, uncertainty of signers’ identity, and dependence on backend servers, are discussed. Besides, the paper offers a decision-making framework for choosing one of gasless verification architectures depending on the presence/absence of state change, authority of proofs, required verification frequency, degree of decentralization needed, and level of technical maturity of system users.