Merged Bitcoin: Proof of Work Blockchains with Multiple Hash Types

• URL: http://arxiv.org/abs/2601.09090v1
• Date: Wed, 14 Jan 2026 02:46:12 GMT
• Title: Merged Bitcoin: Proof of Work Blockchains with Multiple Hash Types
• Authors: Christopher Blake, Chen Feng, Xuachao Wang, Qianyu Yu,
• Abstract summary: 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.
• Score: 3.361973319432671
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Proof of work blockchain protocols using multiple hash types are considered. It is proven that the security region of such a protocol cannot be the AND of a 51\% attack on all the hash types. Nevertheless, a protocol called Merged Bitcoin is introduced, which is the Bitcoin protocol where links between blocks can be formed using multiple different hash types. Closed form bounds on its security region in the $Δ$-bounded delay network model are proven, and these bounds are compared to simulation results. This protocol is proven to maximize cost of attack in the linear cost-per-hash model. A difficulty adjustment method is introduced, and it is argued that this can partly remedy asymmetric advantages an adversary may gain in hashing power for some hash types, including from algorithmic advances, quantum attacks like Grover's algorithm, or hardware backdoor attacks.

Related papers

• Rigorous and Generalized Proof of Security of Bitcoin Protocol with Bounded Network Delay [5.885213212610341]
  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.
  arXiv  Detail & Related papers  (2026-01-14T02:33:19Z)
• Nested Hash Layer: A Plug-and-play Module for Multiple-length Hash Code Learning [61.095479786194836]
  Nested Hash Layer (NHL) is a plug-and-play module for deep supervised hashing models.<n>NHL generates hash codes of multiple lengths simultaneously in a nested structure.<n>NHL achieves an overall training speed improvement of approximately 5 to 8 times across various deep supervised hashing models.
  arXiv  Detail & Related papers  (2024-12-12T04:13:09Z)
• Evaluation of Hash Algorithm Performance for Cryptocurrency Exchanges Based on Blockchain System [0.0]
  This study primarily focuses on analyzing the security and execution efficiency of mainstream hash algorithms in the Proof of Work (PoW) calculations within blockchain systems. It proposes an evaluation factor and conducts comparative experiments to evaluate each hash algorithm. The experimental results indicate that there are no significant differences in the security aspects among SHA-2, SHA-3, and BLAKE2.
  arXiv  Detail & Related papers  (2024-08-08T05:53:04Z)
• 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)
• Quantum One-Wayness of the Single-Round Sponge with Invertible Permutations [49.1574468325115]
  Sponge hashing is a widely used class of cryptographic hash algorithms.<n>Intrepid permutations have so far remained a fundamental open problem.<n>We show that finding zero-pairs in a random $2n$-bit permutation requires at least $Omega (2n/2)$ many queries.
  arXiv  Detail & Related papers  (2024-03-07T18:46:58Z)
• Generalized Hybrid Search and Applications to Blockchain and Hash Function Security [50.16790546184646]
  We first examine the hardness of solving various search problems by hybrid quantum-classical strategies. We then construct a hybrid quantum-classical search algorithm and analyze its success probability.
  arXiv  Detail & Related papers  (2023-11-07T04:59:02Z)
• A quantum algorithm for finding collision-inducing disturbance vectors in SHA-1 [2.963904090194172]
  Modern cryptographic protocols rely on sophisticated hash functions to generate quasi-unique numbers that serve as signatures for user authentication and other security verifications. The security could be compromised by finding texts hash-mappable to identical numbers, forming so-called collision attack. We propose an algorithm that takes advantage of entangled quantum states for concurrent seeding of candidate disturbance vectors.
  arXiv  Detail & Related papers  (2022-10-23T16:01:17Z)
• A Lower Bound of Hash Codes' Performance [122.88252443695492]
  In this paper, we prove that inter-class distinctiveness and intra-class compactness among hash codes determine the lower bound of hash codes' performance. We then propose a surrogate model to fully exploit the above objective by estimating the posterior of hash codes and controlling it, which results in a low-bias optimization. By testing on a series of hash-models, we obtain performance improvements among all of them, with an up to $26.5%$ increase in mean Average Precision and an up to $20.5%$ increase in accuracy.
  arXiv  Detail & Related papers  (2022-10-12T03:30:56Z)
• Quantum collision finding for homomorphic hash functions [0.0]
  We present concrete attack examples to provable hash functions, including a preimage attack to $oplus$-linear hash functions. Hash functions which are additive or multiplicative are vulnerable to a quantum attack using the hidden subgroup problem algorithm for quantum computers.
  arXiv  Detail & Related papers  (2021-07-30T23:01:02Z)
• 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.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.