APoW: Auditable Proof-of-Work Against Block Withholding Attacks

• URL: http://arxiv.org/abs/2601.02496v2
• Date: Thu, 08 Jan 2026 04:27:42 GMT
• Title: APoW: Auditable Proof-of-Work Against Block Withholding Attacks
• Authors: Sergio Demian Lerner,
• Abstract summary: We introduce Auditable Proof-of-Work (APoW) construction inspired by Hashcash-style nonce searching.<n>It enables the auditing of other miners' work through accountable re-scanning of the nonce space.<n>A full deployment of APoW in Bitcoin would require a consensus rule change and minor modifications to mining ASICs.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We introduce Auditable Proof-of-Work (APoW), a novel proof-of-work (PoW) construction inspired by Hashcash-style nonce searching, which enables the auditing of other miners' work through accountable re-scanning of the nonce space. The proposed scheme allows a miner to probabilistically attest to having searched specified regions of the nonce space in earlier mining rounds, while concurrently earning rewards for performing productive work for a new block or pool share. This capability enables miners belonging to a mining pools to audit another miner's claimed effort retroactively, thereby allowing the probabilistic detection of block withholding attacks (BWAs) without requiring trusted hardware or trusted third parties. As a consequence, the construction supports the design of decentralized mining pools in which work attribution is verifiable and withholding incentives are substantially reduced. The scheme preserves the fundamental properties of conventional PoW, including public verifiability and difficulty adjustment, while adding an orthogonal auditability layer tailored to pool-based mining. Finally, while a full deployment of APoW in Bitcoin would require a consensus rule change and minor modifications to mining ASICs, the construction remains practically useful even without consensus changes, for instance, as a pool-level auditing mechanism that enables verifiable pay-for-auditing using existing pool reserves.

Related papers

• A Critical Look into Threshold Homomorphic Encryption for Private Average Aggregation [45.381652768314375]
  Threshold Homomorphic Encryption (Threshold HE) is a good fit for implementing private federated average aggregation.<n>Recent studies have shown that threshold schemes can introduce unexpected security vulnerabilities if an adversary has access to a restricted decryption oracle.
  arXiv  Detail & Related papers  (2026-02-25T15:45:27Z)
• On the Effectiveness of Mempool-based Transaction Auditing [5.182061898490993]
  We study the interplay between mempool auditing and the ability to detect censorship and transaction displacement attacks.<n>Our analysis shows that mempool auditing can result in mis-accusations against miners with a larger probability than 25% in some settings.<n>For the first time, batch-order fair-ordering schemes can offer only strong fairness guarantees for a limited subset of transactions in real-world deployments.
  arXiv  Detail & Related papers  (2026-01-21T13:54:04Z)
• Hashpower allocation in Pay-per-Share blockchain mining pools [0.0]
  This article examines a Pay-per-Share (PPS) reward system, where the pool manager can adjust both the share difficulty and the management fee.<n>Using a simplified wealth model for miners, we explore how miners should allocate their computing resources among different mining pools.
  arXiv  Detail & Related papers  (2025-11-15T13:42:59Z)
• Incentive Attacks in BTC: Short-Term Revenue Changes and Long-Term Efficiencies [45.776687601070705]
  Bitcoin's Difficulty Adjustment Algorithm (DAA) has been a source of vulnerability for incentive attacks such as selfish mining, block withholding and coin hopping strategies.<n>We study the short-term revenue change per hashpower of the adversarial and honest miners for these incentive attacks.<n>For block withholding strategies, it turns out, the honest miners outside the pool profit from the attack, usually even more than the attacker both in the short-term and the long-term.
  arXiv  Detail & Related papers  (2025-11-14T18:18:17Z)
• Efficient Blockchain-based Steganography via Backcalculating Generative Adversarial Network [105.47203971578871]
  We propose a generic blockchain-based steganography framework (GBSF)<n>The sender generates the required fields such as amount and fees, where the additional covert data is embedded to enhance the channel capacity.<n>Based on GBSF, we design a reversible generative adversarial network (R-GAN)<n>We propose R-GAN with Counter-intuitive data preprocessing and Custom activation functions, namely CCR-GAN.
  arXiv  Detail & Related papers  (2025-06-19T04:43:41Z)
• Mining Power Destruction Attacks in the Presence of Petty-Compliant Mining Pools [5.721770755917568]
  Bitcoin's security relies on its Proof-of-Work consensus, where miners solve puzzles to propose blocks.<n>The puzzle's difficulty is set by the difficulty adjustment mechanism (DAM), based on the network's available mining power.<n>Attacks that destroy some portion of mining power can exploit the DAM to lower difficulty, making such attacks profitable.
  arXiv  Detail & Related papers  (2025-02-11T09:44:41Z)
• FiberPool: Leveraging Multiple Blockchains for Decentralized Pooled Mining [2.9281463284266973]
  We present a distributed mining pool named FiberPool to address these challenges.<n>We validate the mining fairness, budget balance, reward stability, and incentive compatibility of the payment scheme FiberPool Proportional adopted by FiberPool.
  arXiv  Detail & Related papers  (2025-01-26T09:08:03Z)
• Collaborative Proof-of-Work: A Secure Dynamic Approach to Fair and Efficient Blockchain Mining [0.1759252234439348]
  This paper introduces a novel Collaborative Proof-of-Work (CPoW) mining approach designed to enhance efficiency and fairness in the network.<n>By addressing the centralization and energy inefficiencies of traditional mining, this research contributes to a more sustainable blockchain ecosystem.
  arXiv  Detail & Related papers  (2024-12-01T05:59:27Z)
• 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)
• Trustless Audits without Revealing Data or Models [49.23322187919369]
  We show that it is possible to allow model providers to keep their model weights (but not architecture) and data secret while allowing other parties to trustlessly audit model and data properties. We do this by designing a protocol called ZkAudit in which model providers publish cryptographic commitments of datasets and model weights.
  arXiv  Detail & Related papers  (2024-04-06T04:43:06Z)
• A Collaboration Strategy in the Mining Pool for Proof-of-Neural-Architecture Consensus [16.372941299296652]
  In most popular public accessible cryptocurrency systems, the mining pool plays a key role because mining cryptocurrency with the mining pool turns the non-profitable situation into profitable for individual miners. In many recent novel blockchain consensuses, the deep learning training procedure becomes the task for miners to prove their workload. While the incentive of miners is to earn tokens, individual miners are motivated to join mining pools to become more competitive.
  arXiv  Detail & Related papers  (2022-05-05T17:08: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)
• Regulation conform DLT-operable payment adapter based on trustless - justified trust combined generalized state channels [77.34726150561087]
  Economy of Things (EoT) will be based on software agents running on peer-to-peer trustless networks. We give an overview of current solutions that differ in their fundamental values and technological possibilities. We propose to combine the strengths of the crypto based, decentralized trustless elements with established and well regulated means of payment.
  arXiv  Detail & Related papers  (2020-07-03T10:45:55Z)

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.