Related papers: Rigorous and Generalized Proof of Security of Bitcoin Protocol with Bounded Network Delay

Rigorous and Generalized Proof of Security of Bitcoin Protocol with Bounded Network Delay

URL: http://arxiv.org/abs/2601.09082v1
Date: Wed, 14 Jan 2026 02:33:19 GMT
Title: Rigorous and Generalized Proof of Security of Bitcoin Protocol with Bounded Network Delay
Authors: Christopher Blake, Chen Feng, Xuechao Wang, Qianyu Yu,
Abstract summary: A proof of the security of the Bitcoin protocol is made rigorous, and simplified in certain parts.<n>A computational model in which an adversary can delay transmission of blocks by time $$ is considered.
Score: 5.885213212610341
License: http://creativecommons.org/licenses/by/4.0/
Abstract: A proof of the security of the Bitcoin protocol is made rigorous, and simplified in certain parts. A computational model in which an adversary can delay transmission of blocks by time $Δ$ is considered. The protocol is generalized to allow blocks of different scores and a proof within this more general model is presented. An approach used in a previous paper that used random walk theory is shown through a counterexample to be incorrect; an approach involving a punctured block arrival process is shown to remedy this error. Thus, it is proven that with probability one, the Bitcoin protocol will have infinitely many honest blocks so long as the fully-delayed honest mining rate exceeds the adversary mining rate.

Related papers

Merged Bitcoin: Proof of Work Blockchains with Multiple Hash Types [3.361973319432671]
It is proven that the security region of such a protocol cannot be the AND of a 51% attack on all the hash types.<n> Merged Bitcoin is introduced, which is the Bitcoin protocol where links between blocks can be formed using multiple different hash types.
arXiv Detail & Related papers (2026-01-14T02:46:12Z)
Voting-Based Semi-Parallel Proof-of-Work Protocol [45.776687601070705]
We first consider the existing parallel PoW protocols and develop hard-coded incentive attack structures.<n>We introduce a voting-based semi-parallel PoW protocol that outperforms both Nakamoto consensus and the existing parallel PoW protocols.
arXiv Detail & Related papers (2025-08-08T17:57:35Z)
A Formal Refutation of the Blockchain Trilemma [0.0]
The so-called blockchain trilemma asserts the impossibility of simultaneously achieving scalability, security, and decentralisation within a single blockchain protocol.<n>We argue that the trilemma constitutes a category error, conflates distinct analytical domains, and relies upon unproven causal assumptions.<n>A constructive counterexample is presented: a blockchain protocol exhibiting unbounded transaction throughput, cryptographic security under adversarial load, and multipath decentralised propagation.
arXiv Detail & Related papers (2025-07-08T09:29:09Z)
Pseudo-Equilibria, or: How to Stop Worrying About Crypto and Just Analyze the Game [48.93355782581436]
We consider the problem of a game theorist analyzing a game that uses cryptographic protocols.<n>We propose a new solution concept: the pseudo-Nash equilibrium.
arXiv Detail & Related papers (2025-06-27T10:21:28Z)
BlockScan: Detecting Anomalies in Blockchain Transactions [16.73896087813861]
BlockScan is a customized Transformer for anomaly detection in blockchain transactions.<n>This work sets a new benchmark for applying Transformer-based approaches in blockchain data analysis.
arXiv Detail & Related papers (2024-10-05T05:11:34Z)
The Latency Price of Threshold Cryptosystem in Blockchains [52.359230560289745]
We study the interplay between threshold cryptography and a class of blockchains that use Byzantine-fault tolerant (BFT) consensus protocols.<n>Our measurements from the Aptos mainnet show that the optimistic approach reduces latency overhead by 71%.
arXiv Detail & Related papers (2024-07-16T20:53:04Z)
Tie-Breaking Rule Based on Partial Proof of Work in a Blockchain [2.9281463284266973]
We propose another countermeasure that can be easily applied to existing proof of work blockchain systems. By using the characteristic of partial proof of work, the proposed method enables miners to choose the last-generated block in a chain tie. Only weak synchrony, which is already met by existing systems such as Bitcoin, is required for effective functioning.
arXiv Detail & Related papers (2024-03-22T08:24:12Z)
Blockchain Large Language Models [65.7726590159576]
This paper presents a dynamic, real-time approach to detecting anomalous blockchain transactions. The proposed tool, BlockGPT, generates tracing representations of blockchain activity and trains from scratch a large language model to act as a real-time Intrusion Detection System.
arXiv Detail & Related papers (2023-04-25T11:56:18Z)
Compression for Qubit Clocks [55.38708484314286]
We propose a compression protocol for $n$ identically prepared states of qubit clocks. The protocol faithfully encodes the states into $(1/2)log n$ qubits and $(1/2)log n$ classical bits.
arXiv Detail & Related papers (2022-09-14T09:45:53Z)
Quantum Multi-Solution Bernoulli Search with Applications to Bitcoin's Post-Quantum Security [67.06003361150228]
A proof of work (PoW) is an important cryptographic construct enabling a party to convince others that they invested some effort in solving a computational task. In this work, we examine the hardness of finding such chain of PoWs against quantum strategies. We prove that the chain of PoWs problem reduces to a problem we call multi-solution Bernoulli search, for which we establish its quantum query complexity.
arXiv Detail & Related papers (2020-12-30T18:03:56Z)

This list is automatically generated from the titles and abstracts of the papers in this site.