Skip to content

Blockchain

Understand how hash-linked blocks, transaction validation and consensus work together, and why a recorded transfer is not automatically final or economically sound.

A blockchain is a ledger whose records are grouped into ordered blocks linked by cryptographic hashes, with an accepted history determined by network protocol rules. For a quant working with cryptocurrency, this separates three questions: was a transfer recorded, was it valid under the rules, and how secure is its place in the accepted history?

The blocks provide a shared transaction history. They do not by themselves establish an asset's market value, the quality of an investment, or the truth of information supplied from outside the network.

What the chain contributes

A cryptographic hash is a digest computed from data. Later blocks contain a hash reference to an earlier block. Changing committed data will, with overwhelming probability, change the relevant hashes, so the old links no longer match. This makes alteration detectable against a known history. Bitcoin's developer guide describes both the transaction commitments inside a block and the link to its predecessor.

Someone can also recompute hashes for a rewritten sequence. The reason a network rejects or resists that alternative lies in its validation, consensus and security rules—not in the existence of a hash link alone.

Keep these jobs separate:

JobQuestion it answers
Hash commitmentsDoes this data match the history to which the hashes commit?
Transaction validationIs this change permitted from the preceding state?
Consensus and fork choiceWhich valid history does the network accept when candidates compete?
FinalityUnder what conditions can an accepted history still be displaced?
Ethereum's block documentation illustrates the distinction: blocks refer to their parents, while execution clients separately execute transactions and check the resulting state.

A transfer that balances

Consider a fictional account ledger, measured in units of one token. Account A starts with 100 units and B with 0. Assume an authorised transfer of 30 units from A to B, with no fees, issuance, rewards or burning.
AccountBeforeChangeAfter
A100−3070
B0+3030
Total1000100

The accepted transfer changes the account balances without changing the total. A block can commit to that transfer's position in the history. Hashing a different record that credits B without the required debit would not make that record valid under these toy rules.

Fictional account ledger: A has 100 units and B has 0; an accepted transfer of 30 leaves A with 70 and B with 30, keeping the total at 100. A separate three-block chain shows symbolic parent-hash references. Validation and finality require protocol rules beyond hash links.
Fictional account ledger: A has 100 units and B has 0; an accepted transfer of 30 leaves A with 70 and B with 30, keeping the total at 100. A separate three-block chain shows symbolic parent-hash references. Validation and finality require protocol rules beyond hash links.
Original fictional account-ledger illustration, with no fees or issuance. Balances are a view derived from accepted transfers; the diagram is not a block-format specification. Hash labels hA and hB are symbolic, not actual digests.

The order matters when requests conflict. Suppose A submits pending requests to transfer 30 and 80 units from its original balance of 100. Each is affordable in isolation, but together they require 110. If the 30-unit request executes first, A has 70 left and the 80-unit request fails the balance check. If the 80-unit request executes first, A has 20 left and the 30-unit request fails. This is one simple reason transaction ordering risk belongs in execution analysis.

This account example is not Bitcoin's transaction model. Bitcoin spends previously unspent transaction outputs; it does not simply debit an account balance in this way. Nor is the constant total a universal blockchain rule: actual protocols specify their own issuance, burning and transaction fees.

Included is not automatically final

A transaction can be valid and included in a block while that block's place in the accepted history is still unsettled. Competing valid blocks can arise, and the protocol needs rules for selecting a history.

Bitcoin combines transaction validation with proof of work; additional work accumulated after a block makes replacing its history harder under the model's assumptions. Ethereum uses proof of stake, with validator votes and a separate checkpoint-finality mechanism. Its protocol documentation distinguishes fork choice from finality and describes the stake penalties associated with conflicting finalised histories. A count of blocks therefore has no universal settlement meaning across networks.

For a trading or reconciliation system, retain the network, transaction identifier, block reference and the confirmation or finality policy used. A pending transfer, a transfer in the current chain and a transfer meeting that policy are different observations. Treating them as identical can understate settlement risk.

Sources

Last updated
  • digital assets
  • distributed ledgers
  • transaction validation
  • consensus
← Back to the glossaryBack to top ↑