BlockchainMay 20, 20265 min read

Proof of Work: Why Can Miners Order Transactions?

Proof of Work uses a mechanism that is expensive to compute and cheap to verify, allowing miners to compete for new blocks in an open network and using accumulated work to determine the ordering of transaction history. This article explains how PoW works, why miners can order transactions, its security significance, and the miner-economic logic behind BSV’s focus on large blocks, low fees, and high transaction volume.

The Bottom Line: PoW Is Not “Wasted Computation,” but a Consensus Mechanism for Ordering Transactions

Proof of Work (PoW) is a mechanism that makes “writing a new block” costly, verifiable, and competitive. Miners spend computing power to find a block that satisfies the required difficulty, and the network then uses accumulated work to determine the ordering of transaction history.

In other words, miners do not order transactions because of a special identity or permission. They compete for the right to record the “next block” in an open network by completing verifiable computational work.

The core value of PoW is that it makes attacking the historical record expensive. It is not about wasting electricity; it anchors the security of the blockchain ledger to an external cost in the real world.

Proof of Work: Why Can Miners Order Transactions? article cover

Why Does a Blockchain Need Proof of Work?

If a blockchain were simply a shared document that anyone could write to, it would quickly run into a basic problem: who decides what gets written on the next page?

For example, Alice and Bob submit different versions of transaction history at almost the same time. Which one should the network accept? Traditional databases usually appoint an administrator, a master node, or a centralized arbitrator to make that decision. But the goal of Bitcoin/BSV is to allow participants who do not fully trust one another to reach consensus on the same ledger in an open network.

PoW’s solution is straightforward:

Anyone who wants to write the next block must first complete a computational task that is very difficult to perform but easy to verify.

The key here is asymmetry:

  • Finding the answer is hard: miners must keep trying large numbers of random values.
  • Verifying the answer is easy: other nodes only need to compute a hash once to determine whether the block qualifies.

This mechanism allows anyone to compete, while preventing anyone from cheaply falsifying history.

How PoW Works: An Intuitive Example

PoW can be understood as a hash-guessing game.

Suppose the network rules require miners to find a number, combine it with the block contents, and run a hash calculation so that the resulting hash begins with many zeros.

Miners cannot use a “clever formula” to calculate the answer directly. They can only try repeatedly:

TEXT
1Block contents + nonce 1 -> hash does not qualify
2Block contents + nonce 2 -> hash does not qualify
3Block contents + nonce 3 -> hash does not qualify
4...
5Block contents + nonce N -> hash qualifies

Here, the nonce is the random number or counter value that miners keep adjusting. Whoever first finds a result that meets the difficulty requirement can broadcast the candidate block to the network.

Other nodes do not need to repeat all of the miner’s previous attempts. They only need to hash the block once to verify whether it satisfies the current difficulty requirement.

This is the commonly cited property of PoW: the work is hard, but checking it is easy.

Why Can Miners Order Transactions?

Miners can order transactions not because they “own the ledger,” but because they compete to package blocks through PoW.

In general, miners follow this process:

  1. Collect transactions propagated across the network.
  2. Check whether the transactions are valid.
  3. Select the transactions to include in a block.
  4. Construct a candidate block.
  5. Perform PoW calculations on the candidate block.
  6. After finding a valid block, broadcast it to the network.
  7. Other nodes verify the block and continue mining new blocks after it.

Whoever finds a valid block first temporarily determines the on-chain order of the next batch of transactions.

It is important to note that this decision is not permanently dictated by a single miner. If two miners find different valid blocks at almost the same time, the network may experience a temporary fork. After that, the branch that gains more accumulated work is usually the one the network continues to extend.

Therefore, the basis for ordering transactions through PoW is not trust in identity, but accumulated work.

How Does PoW Improve Blockchain Security?

PoW’s security function is mainly reflected in raising the cost of tampering with history.

Suppose an attacker wants to reverse a transaction from 10 blocks ago. They cannot simply change that one transaction and be done. Once the transaction content changes, the corresponding block’s hash also changes, which affects all subsequent blocks.

The attacker must start mining again from the modified block and catch up with—or even surpass—the accumulated work that the honest network continues to produce during that time.

This means:

  • The deeper a block is, the more work has accumulated after it.
  • The more PoW an attacker needs to redo.
  • The higher the cost of modifying history.

This is why, in PoW networks such as Bitcoin/BSV, the more confirmations a transaction has, the harder it generally is to change.

PoW from the BSV Perspective: Miner Economics and High Transaction Volume

BSV inherits Bitcoin’s PoW model while also placing clear long-term emphasis on miner economics.

In the Bitcoin system, miner revenue mainly comes from two sources: the block subsidy and transaction fees. As the block subsidy gradually declines, miner revenue needs to rely increasingly on transaction fees over the long term.

BSV’s approach is that if miner economics are to be supported while keeping per-transaction fees low, the network must be able to carry a large number of transactions. In other words, the goal is not to make every transaction expensive, but to keep each transaction low-cost while generating sustainable revenue through extremely high transaction volume.

Therefore, BSV has long emphasized the following directions:

  • Large blocks;
  • Low fees;
  • High transaction volume;
  • Enterprise and data applications;
  • High-throughput node architectures such as Teranode.

From this perspective, BSV’s vision for miner economics can be summarized as: very low fees per transaction, but extremely large transaction volume.

This is a logically clear model, but one that needs real-world validation. It requires sufficient genuine transaction demand on the network, and it also requires node software and network infrastructure to handle large-scale transactions reliably.

PoW and the Energy Debate: Does the Security Cost Match the Value?

A common controversy around PoW is energy consumption.

Supporters argue that PoW uses external costs to protect the ledger, similar to how protecting financial systems, data centers, and critical infrastructure in the real world also requires ongoing costs. PoW’s energy consumption does not exist in isolation; it is part of the security model.

Critics argue that PoW consumes a significant amount of energy, and that especially when actual network usage is insufficient, the security cost may not match the social value produced.

For Bitcoin/BSV, a more pragmatic assessment is that PoW is the core of the security model, but its economic rationality depends on whether the network can generate enough real transaction demand and fee revenue. If on-chain applications, enterprise use cases, and data transactions can reach scale, the security cost of PoW is more likely to be supported by real value.

Common Misunderstandings for Beginners

Misunderstanding 1: Miners Create Transactions

Transactions are usually created by users, wallets, or applications. The main role of miners is to validate, order, and package transactions—not to create transactions out of thin air on behalf of users.

Misunderstanding 2: The Stronger PoW Is, the Faster Transactions Become

The strength of PoW mainly affects the cost of attack and the security of the chain. The transaction experience is also affected by block intervals, network propagation speed, miner policies, and the confirmation policies adopted by applications.

Therefore, security and “speed as perceived by users” are not the same concept.

Misunderstanding 3: Miners Can Freely Change Your Transactions

Miners cannot forge your signature, nor can they spend your UTXOs. What miners can do is choose whether to include a transaction, or choose which conflicting transaction enters a block when conflicting transactions exist.

This is why private keys and signature mechanisms remain the foundation of user control over assets.

Summary: PoW Uses Work to Establish Ordering Rules for an Open Network

PoW solves a fundamental problem in open networks: without a central administrator, who decides the order of transaction history?

Through a mechanism that is “expensive to compute and cheap to verify,” PoW lets miners compete for new blocks and lets the network choose ledger history based on accumulated work. As a result, transaction ordering does not depend on identity-based authorization, but on verifiable work.

In BSV, PoW remains the core of the security model. Its long-term economic model is closely linked to large blocks, low fees, high transaction volume, and enterprise-grade applications. Whether this model can fully take effect in the future depends on whether real transaction demand and infrastructure throughput capacity can continue to grow.

References

Collection

BSV Basics

Part 4 of 43

A curated series covering BSV, blockchain fundamentals, protocol capabilities, and ecosystem knowledge.

View collection

Reading path

Progress 4/43

  1. 01
    Part 1

    Why BSV Still Matters for Long-Term Settlement

    Read article

    A compact note on settlement design, data permanence, and why builders keep looking at BSV.

    Apr 30, 20265 min read
  2. 02
    Part 2

    P2P Electronic Cash: What Is Peer-to-Peer Electronic Cash?

    Read article

    Peer-to-peer electronic cash is the starting point for understanding Bitcoin and BSV. It emphasizes transferring digital value directly through transactions, signatures, and a public ledger, rather than relying on central platform accounts. This article explains peer-to-peer, cash, double spending, UTXOs, and why BSV emphasizes low fees, high-frequency transactions, and on-chain data.

    May 19, 202615 min read
  3. 03
    Part 3

    Timestamp Server: Why Is Blockchain a Time-Ordered Record?

    Read article

    Blockchain is not just a ledger; it is also a public time-ordering machine. This article explains what the timestamp server means in Bitcoin/BSV, the role of block height and confirmations, and the value of timestamps in double-spend prevention and data attestation.

    May 20, 202615 min read
  4. 04
    Part 4Current

    Proof of Work: Why Can Miners Order Transactions?

    Read article

    Proof of Work uses a mechanism that is expensive to compute and cheap to verify, allowing miners to compete for new blocks in an open network and using accumulated work to determine the ordering of transaction history. This article explains how PoW works, why miners can order transactions, its security significance, and the miner-economic logic behind BSV’s focus on large blocks, low fees, and high transaction volume.

    May 20, 20265 min read
  5. 05
    Part 5

    How the BSV Network Works: Transactions, Blocks, Fees, and Miner Incentives

    Read article

    This article explains the basic mechanics of the BSV network: how transactions are constructed, how blocks organize them, how miners are incentivized, and why BSV places special emphasis on low fees, large blocks, and high-throughput on-chain transactions.

    May 20, 202615 min read
  6. 06
    Part 6

    Introduction to SPV: Why Lightweight Clients Do Not Need to Download the Full Chain

    Read article

    SPV (Simplified Payment Verification) allows lightweight clients to verify that a transaction is included in a block without downloading the full blockchain. This article explains how SPV works, the role of Merkle proofs, what SPV can and cannot prove, and why SPV is a core capability in the BSV architecture.

    May 20, 202615 min read
  7. 07
    Part 7

    How BSV’s Roadmap Differs from BTC and BCH: Why It Emphasizes On-Chain Scaling, Low Fees, and Enterprise Data

    Read article

    BTC, BCH, and BSV all come from Bitcoin, but their technical roadmaps differ significantly. This article explains why BSV chooses a low-fee, high-volume, large-scale on-chain scaling approach, through the lenses of on-chain scaling, low fees, a stable protocol, SPV, enterprise data, and real-world challenges.

    May 20, 202615 min read
  8. 08
    Part 8

    WIFs, Mnemonic Phrases, and HD Wallets: An Introduction to Key Management in BSV Wallets

    Read article

    WIFs, mnemonic phrases, and HD wallets all relate to key storage, recovery, and derivation, but they mean different things. This article explains their differences, the role of xpubs, and security practices for BSV wallets and application development.

    May 20, 202625 min read
  9. 09
    Part 9

    What Is the Difference Between BSV Mainnet and Test Environments?

    Read article

    Mainnet carries real value, while test environments are for learning and development. This article explains the differences between BSV mainnet and test environments, common risks, SDK usage considerations, and practical environment-separation recommendations for project configuration.

    May 24, 20265 min read
  10. 10
    Part 10

    A Wallet Is Not an Account System: BSV Wallets Manage Keys and UTXOs

    Read article

    A BSV wallet is not a traditional account system. There is no single on-chain balance field; instead, the wallet calculates balances and creates transactions by managing private keys, UTXOs, inputs, outputs, signatures, and related data. This distinction is essential for understanding change, multiple inputs, non-custodial wallets, and application authorization.

    May 24, 202615 min read
  11. 11
    Part 11

    BRC-100: A Standard Interface Between Wallets and Applications

    Read article

    BRC-100 is an interface standard in the BSV ecosystem that describes how applications and wallets communicate. It emphasizes that applications express business intent while wallets retain control of keys, helping non-custodial applications request transaction creation, signing, and returned results in a safer and more consistent way.

    May 24, 20268 min read
  12. 12
    Part 12

    What Is a Transaction Input? Understanding BSV Transaction Inputs and UTXO References

    Read article

    A transaction input is the funding source of a BSV transaction. It references a specific unspent output from a previous transaction and provides unlocking data. Understanding inputs helps explain the UTXO model, outpoints, double-spend conflicts, fee calculation, and transaction debugging.

    May 26, 202615 min read
  13. 13
    Part 13

    Understanding BSV Transaction Outputs: Amounts, Locking Scripts, and UTXOs

    Read article

    A transaction output is a new unit of value created by a BSV transaction, usually consisting of an amount and a locking script. Outputs can represent payments and change, but they can also carry OP_RETURN data, token state, or business records. Understanding outputs, UTXOs, and output indexes is fundamental to understanding BSV transactions and application protocol design.

    May 26, 202615 min read
  14. 14
    Part 14

    What Is a TXID? Its Role, Common Misunderstandings, and Design Tips in BSV

    Read article

    A TXID is the most common transaction identifier in BSV. It can be used to look up transactions, reference outputs, store business records, and build SPV proof flows. But a TXID identifies the whole transaction, not a specific output, and it does not mean the transaction is final. Real applications should store it together with the output index, status, raw transaction, and proof materials.

    May 26, 202615 min read
  15. 15
    Part 15

    Understanding Change Outputs in BSV Transactions: Why They Must Be Explicitly Included

    Read article

    A change output is a key concept in BSV’s UTXO model: old UTXOs must be spent in full, and any unspent amount must be returned to the payer through a new output. This article explains how change works, how it relates to fees, change addresses, privacy, and practical UTXO management.

    May 26, 202615 min read
  16. 16
    Part 16

    How BSV Transaction Fees Are Calculated: Total Inputs Minus Total Outputs

    Read article

    BSV transaction fees are not stored as a separate field. They are calculated as total inputs minus total outputs. Understanding this rule helps developers handle change correctly, estimate fees, manage UTXOs, and avoid accidentally turning remaining balance into fees.

    May 26, 202615 min read
  17. 17
    Part 17

    What Is a Raw Transaction? The Basics of BSV Transaction Serialization, TXIDs, and Signatures

    Read article

    A raw transaction is the original byte representation of a transaction after protocol-compliant serialization, usually shown as a hexadecimal string. It is central to TXID calculation, signing, broadcasting, and debugging, and is a key concept for understanding how BSV transactions work at the protocol level.

    May 26, 202610 min read
  18. 18
    Part 18

    Endian Issues in BSV Transaction Debugging: Why TXIDs Can Look Reversed

    Read article

    Endian is a common byte-order issue when debugging BSV transactions, especially in raw transactions, TXIDs, outpoints, numeric fields, and Merkle proofs. Understanding the difference between display format and serialized bytes helps avoid false “TXID mismatch” or “proof calculation failed” conclusions.

    May 26, 202612 min read
  19. 19
    Part 19

    What Is a UTXO? Understanding the Foundation of the BSV Transaction Model

    Read article

    A UTXO, or “unspent transaction output,” is the basic unit of the BSV transaction model. A wallet balance is not an on-chain account field, but the sum of controllable UTXOs. Understanding UTXOs helps explain BSV inputs, outputs, change, fees, double-spending, Script, and parallel processing.

    May 27, 202615 min read
  20. 20
    Part 20

    In BSV, Spending Means Consuming Old UTXOs and Creating New Ones

    Read article

    In BSV, spending does not update a balance. It consumes old UTXOs and creates new ones. Understanding this model helps explain payments, change, transaction chains, and the basic logic behind tokens and application state transitions.

    May 27, 202612 min read
  21. 21
    Part 21

    One Address Can Have Many UTXOs: Understanding Addresses, Balances, and Transaction Construction in BSV

    Read article

    In BSV’s UTXO model, an address is not an account or a single balance slot. The same address can be associated with multiple UTXOs, and a wallet balance is simply the sum of those outputs. Understanding this is essential for transaction construction, fee handling, UTXO fragmentation, and privacy.

    May 27, 20265 min read
  22. 22
    Part 22

    Why the UTXO Model Is Suitable for Parallel Processing – The Technical Foundation of BSV Scaling

    Read article

    The UTXO model splits state into independent outputs, allowing transaction verification to proceed in parallel, providing a key data structure foundation for BSV's on-chain scaling and high throughput. This article compares the account model with the UTXO model, explains the principles of parallelism, practical limitations, and its relationship with Teranode and application design.

    Jun 2, 20264 min read
  23. 23
    Part 23

    Understanding Bitcoin Double Spend: Why the Same UTXO Cannot Be Spent Twice

    Read article

    Double spending is a core problem for digital cash systems. This article explains the principle, transaction structure, miner's role, 0-conf risk, signatures and double spend, and engineering best practices.

    Jun 2, 20264 min read
  24. 24
    Part 24

    Understanding Locking Script in BSV: The Core Mechanism of Spending Conditions

    Read article

    Locking script is an essential part of a BSV transaction, defining the conditions under which a UTXO can be spent. This article starts from the basics, gradually explaining the location of locking scripts, their relationship with addresses, how they are expressed, and their importance in applications.

    Jun 2, 20264 min read
  25. 25
    Part 25

    Deep Dive into Unlocking Script: The 'Key' to Spending Blockchain Transactions

    Read article

    Unlocking script is the unlocking material in a transaction input that satisfies the locking conditions of a previous output. This article comprehensively explains the concept, location, working principle, and common misconceptions.

    Jun 2, 20264 min read
  26. 26
    Part 26

    P2PKH: BSV's Most Common Payment Script Template Explained

    Read article

    P2PKH (Pay to Public Key Hash) is the most basic payment script in Bitcoin/BSV. This article breaks down its core logic, workflow, relationship with addresses, unlocking conditions, and why BSV developers need to understand it.

    Jun 2, 20264 min read
  27. 27
    Part 27

    OP_RETURN: A Beginner's Guide to Writing Data on the BSV Blockchain

    Read article

    Learn the basics of OP_RETURN, how it differs from regular payments, data format requirements, privacy considerations, and use cases.

    Jun 2, 20263 min read
  28. 28
    Part 28

    Understanding Bitcoin Script: A Stack-Based Scripting Language and Its Execution Model

    Read article

    Bitcoin Script is a stack-based scripting language used to verify transaction spending conditions. This article starts with the concept of a stack, illustrates its execution process with examples, and explores key points such as P2PKH, restricted design, and BSV applications, helping readers understand the core mechanism of this on-chain verification language.

    Jun 2, 20263 min read
  29. 29
    Part 29

    Standard Scripts vs Non-Standard Scripts: The Easily Overlooked Boundary in BSV Development

    Read article

    A transaction that is valid under consensus rules may not be processed by the network. Understand standard scripts and miner policies to avoid broadcast failures.

    Jun 2, 20264 min read
  30. 30
    Part 30

    Getting Started with @bsv/sdk: Installation, Verification, and First Steps

    Read article

    Introduces the installation, project setup, and verification process for @bsv/sdk, helping developers quickly enter the BSV development environment and understand the SDK's role in the tech stack.

    Jun 15, 20264 min read
  31. 31
    Part 31

    WalletClient: The Communication Entry Point Between Applications and Wallets

    Read article

    WalletClient is a standardized client for connecting wallets in BSV applications. It enables applications to describe transaction intent while the wallet handles authorization, signing, and UTXO management, thereby isolating complexities like private keys, UTXOs, and signing.

    Jun 15, 20264 min read
  32. 32
    Part 32

    Creating Your First BSV Transaction with createAction(): A Beginner's Guide

    Read article

    createAction() is the core method in the BSV SDK, allowing applications to describe transaction actions via a high-level interface while the wallet handles signing, fees, and broadcasting. This article explains its principles, parameters, and practical usage.

    Jun 15, 20264 min read
  33. 33
    Part 33

    Auto-Select Inputs, Change, and Fees: How the Wallet Builds a Complete Transaction for You

    Read article

    When using the high-level SDK, the wallet automatically selects spendable UTXOs, generates change outputs, and calculates fees. This article explains how this process works, its benefits, and potential risks.

    Jun 15, 20264 min read
  34. 34
    Part 34

    Writing Data to the BSV Blockchain: From OP_RETURN to Application Protocols

    Read article

    BSV transactions can do more than transfer satoshis. By including data outputs, you can record text, hashes, or business events on-chain. This article starts with the first Hello BSV transaction, explains the difference between data outputs and payment outputs, how to construct an OP_RETURN using the SDK, the reason for hex encoding, and how to move toward structured protocol design.

    Jun 16, 20264 min read
  35. 35
    Part 35

    Viewing BSV Transactions with WhatsOnChain: A Complete Guide from txid to On-Chain Structure

    Read article

    This article teaches you how to use the block explorer WhatsOnChain to view transaction details, understand core concepts like inputs, outputs, scripts, and fees, and leverage the explorer to infer the underlying logic of the SDK.

    Jun 16, 20264 min read
  36. 36
    Part 36

    Getting started with BSV transactions: the right way to manually specify inputs

    Read article

    In BSV's UTXO model, manually specifying transaction inputs is a must-have skill for advanced development. This article explains the essence of inputs, the required information, code examples, and common pitfalls, helping you avoid the mental trap of "debiting an address."

    Jun 18, 20264 min read
  37. 37
    Part 37

    Manually Specifying Transaction Outputs: A Key Step in Designing BSV Applications

    Read article

    Learn how Bitcoin transaction outputs work by constructing transactions manually. This article covers output types, change rules, index ordering, and common pitfalls, helping you advance from “sending transactions” to “designing BSV applications.”

    Jun 18, 20263 min read
  38. 38
    Part 38

    Bitcoin Transaction Fees: Calculation, Influencing Factors, and Practical Guidelines for BSV

    Read article

    Transaction fees are not an explicit field but the difference between total inputs and total outputs. Understanding the fee calculation logic, factors affecting transaction size, and BSV network policies is essential for building on-chain applications.

    Jun 18, 20264 min read
  39. 39
    Part 39

    Why Every Input in a Bitcoin Transaction Needs Its Own Signature

    Read article

    Understand the necessity of multi-input signatures in Bitcoin transactions, avoid common misunderstandings, and learn the basics of P2PKH signing, SDK usage, and what signatures actually protect.

    Jun 18, 20264 min read
  40. 40
    Part 40

    BSV Transaction Serialization: From Object to Broadcast

    Read article

    Understanding transaction serialization is key to connecting application development with the blockchain network. This article explains why serialization is needed, the standard transaction structure, the role of hex, serialization and deserialization in the SDK, the relationship with txid, and common misconceptions, helping you move from calling the SDK to debugging on-chain data.

    Jun 18, 20264 min read
  41. 41
    Part 41

    BSV Transaction Broadcasting: A Complete Guide from Construction to Submission

    Read article

    In BSV development, constructing a transaction is only the first step. This article explains the significance of transaction broadcasting, common misconceptions, pre-broadcast checks, how to interpret the return value, and failure reasons, helping developers correctly submit transactions to the network.

    Jun 18, 20264 min read
  42. 42
    Part 42

    Transaction Chains: How a Transaction Spends a Freshly Created UTXO

    Read article

    To truly grasp the Bitcoin white paper's definition of a coin as a chain of digital signatures, you must understand transaction chains. This article starts from the simplest model to explain how UTXOs transfer between transactions and why transaction chains are essential for state management in BSV applications.

    Jun 18, 20264 min read
  43. 43
    Part 43

    The Bitcoin Block Header: The 80‑Byte Foundation for SPV and Light Clients

    Read article

    The block header is an 80‑byte summary of a Bitcoin block. It does not contain full transactions, yet it is the critical structure linking the proof‑of‑work chain and committing to the transaction set. This article explains the header fields, Merkle root, and SPV principles, helping you understand how BSV enables massive scaling.

    Jun 20, 20265 min read

Recommended articles