A block is created in several steps: a network node gathers unconfirmed transactions, a miner or validator forms them into a block, adds a reference to the previous block, and computes a unique hash, after which it broadcasts the completed block to other network participants for verification and addition to the chain. The entire process takes from a few seconds to ten minutes, depending on the network.
How a block is created in a blockchain: a short answer
A block is created by a network node that selects transactions from the queue, packages them into a structure with a header, computes the hash of that structure, and broadcasts the result to other nodes. If most nodes confirm that the block is valid, it becomes part of the chain, and its creator receives a reward.
This description is equally accurate for Bitcoin, Ethereum, and most other public blockchains, but the process details depend on the consensus algorithm. In Proof of Work networks, such as Bitcoin, a miner creates the block by trying different hash values until finding one that meets the difficulty requirement. In Proof of Stake networks, such as Ethereum after 2022, a validator selected by an algorithm based on the amount of coins they have staked creates the block—without trying different values.
The general sequence of steps that every block goes through looks like this:
The key difference between a blockchain and a conventional database is that no block can be created alone and without detection: each subsequent block references the previous block’s hash, so changing an old record means recalculating every block after it—which requires simultaneous control over most of the network’s computing power or staked coins. This chain dependency is what makes blockchain data practically immutable, rather than any separate security feature.
The rest of the article breaks down the process step by step: what a block consists of, who exactly creates it, how transactions get into it, what a hash is, and why finding one through Proof of Work consumes the energy of entire countries.
What a block consists of and what it stores
A block consists of two parts: a header with metadata (the previous block’s hash, timestamp, Merkle root, and nonce) and a body containing a list of transactions. The header is only about 80 bytes, but it determines the block’s final hash and its place in the chain.
The header is a compact set of fields that describe the block but do not contain the transactions themselves in full. It is the header that is hashed when searching for a suitable block in Proof of Work, so its size is deliberately kept to a minimum: trying hash variations for a small structure is faster than for a block weighing several megabytes.
| Header field | What it contains | What it is used for |
|---|---|---|
| Version | The protocol number according to which the block was assembled | Shows which validation rules should be applied |
| Previous block hash | The unique fingerprint of the block preceding the current one | Links the blocks into a chain and protects against history tampering |
| Merkle root | A single hash derived from the hashes of all transactions in the block | Makes it possible to verify whether a transaction belongs to the block without downloading the entire block |
| Timestamp | The approximate time when the block was created, in Unix time | Used to calculate difficulty and order blocks |
| Difficulty (bits/target) | The threshold that the final hash must meet | Regulates how difficult it is to find a suitable block |
| Nonce | The number a miner adjusts to obtain the required hash | The only field that a miner is free to change while trying different values |
The block body is an ordered list of transactions, each of which includes the sender’s address, the recipient’s address, the amount, and a digital signature. The body size is limited: for Bitcoin, the block limit is about 1–4 MB, depending on the share of SegWit transactions; for Ethereum, the limit is expressed not in bytes but in gas—the total computational complexity of all transactions in the block, which usually fits within 30 million gas.
The Merkle root is the result of repeatedly hashing all the transactions in the block in pairs until a single final hash remains. If even one transaction is changed, the Merkle root changes completely, along with the header hash. Lightweight wallets use this property: to verify that a specific transaction is included in a block, it is enough to obtain a short path of hashes (a Merkle proof) rather than download the entire block.
Some networks have a slightly broader header structure: in Ethereum, for example, it also includes the state root and receipts root, which record not only the list of transactions but also the final state of all accounts after they are executed. This difference stems from the fact that Ethereum is not merely a ledger of transfers but a platform for smart contracts, where recording the result of code execution matters, not just the fact that a transaction took place.
Who creates blocks: miners, validators, and their role
Blocks are created by network nodes that perform a special role: in Proof of Work networks, these are miners competing with computing power, while in Proof of Stake networks, they are validators selected based on the amount of staked coins. Ordinary nodes, which simply store a copy of the blockchain and verify blocks, do not create them themselves.
The difference between these roles is fundamental: mining requires physical equipment and electricity and rewards whoever solves the computational puzzle first, while staking requires locked-up capital and rewards the participant randomly selected by the protocol, in proportion to the size of their stake. Both models solve the same problem: making block creation sufficiently costly or risky so that cheating does not pay off.
| Parameter | Miner (Proof of Work) | Validator (Proof of Stake) |
|---|---|---|
| What is required to participate | Specialized equipment (ASIC, GPU) and electricity | Locked-up coins — for example, 32 ETH for a solo Ethereum validator |
| How the block creator is selected | The first participant to find a hash below the target value wins | A random algorithm selects a validator, weighting the probability by the size of the stake |
| Risk of dishonest behavior | Wasted electricity and equipment | Slashing — partial or complete loss of staked coins |
| Energy consumption | High: the Bitcoin network consumes an amount comparable to that of a small country | More than 99% lower than in Proof of Work, according to the Ethereum Foundation |
| Examples of networks | Bitcoin, Litecoin, Dogecoin, Monero | Ethereum, Cardano, Solana, Polkadot |
Both models also include intermediate variants. In Delegated Proof of Stake (DPoS), used, for example, in EOS and TRON, coin holders vote for a limited list of delegates, and only these delegates create blocks in turn — this speeds up the network but concentrates block creation in the hands of a few dozen participants. In Proof of Authority (PoA), blocks are created by pre-approved nodes with verified reputations — this model is suitable for corporate and test networks where speed matters more than decentralization.
Common misconception
“Any wallet owner is a node that can create a block.” In reality, the vast majority of users operate through lightweight wallets that do not participate in block creation at all, while ordinary full nodes store and verify the chain but do not mine or validate without separate configuration and, for PoS, staked capital.
In large networks, solo mining is practically unprofitable because of intense competition, so most miners join pools, where computing power is combined and the rewards found are distributed among participants in proportion to their contribution. Validators have a similar mechanism: users who do not have enough coins for solo staking delegate them to a staking pool or an exchange that acts as a validator itself and shares the rewards with depositors after deducting a fee.
How transactions get into a block and what the mempool is
A transaction gets into a block through the mempool — a shared queue of unconfirmed operations visible to all network nodes. A submitted transaction first enters the mempool, after which a miner or validator selects it for inclusion in a block, usually prioritizing those that paid a higher fee.
The mempool (memory pool) is not stored centrally: each network node has its own local copy, and they may differ slightly depending on which transactions have reached them. When a user signs and sends a transaction through a wallet, it first reaches the nearest node, which checks its basic validity (the signature, sufficient balance, and absence of double spending) and broadcasts it to neighboring nodes — within seconds, the transaction spreads throughout the network.
How transactions are selected to enter a block first
Transactions with the highest fee per byte of data or unit of gas enter the block first, because the miner or validator receives this fee as part of the reward and has an incentive to assemble a block with the highest total profit. Transactions with low fees remain in the mempool and wait until the network becomes less congested.
In Bitcoin, the fee is specified in satoshis per virtual byte (sat/vByte), and wallets usually offer several options — “slow,” “standard,” and “fast” — with different rates. Since 2021, Ethereum has used the EIP-1559 mechanism: part of the fee (the base fee) is burned automatically and changes depending on network congestion, while the user adds a tip (the priority fee) for the miner or validator on top to speed up transaction inclusion.
If the network is congested and the user set too low a fee, the transaction may remain in the mempool for hours or even days. It has three possible outcomes: it will wait its turn and enter a block, be replaced through the RBF (Replace-By-Fee) mechanism (available in Bitcoin) with a version carrying a higher fee, or be evicted from nodes’ mempools as “stuck” if queue space is limited and enough more profitable transactions are available.
Typical beginner mistake
Setting the minimum fee during peak network congestion and expecting fast confirmation. A transaction with a fee that is too low is not “lost,” but it may wait its turn indefinitely — sometimes it is more practical to cancel it through RBF or wait for network congestion to subside than to pay again for urgency.
It is important to understand that entering the mempool does not mean that the transaction has already been completed. Until it is included in a block and the block is confirmed by the network, the recipient should not consider the funds credited. This also applies to exchanges, which typically wait for anywhere from one to several dozen confirmations, depending on the amount and network, before crediting a deposit to the user’s balance.
What a block hash is and how it is calculated
A block hash is a unique fixed-length string produced by passing the block header data through a mathematical hash function. Even the slightest change to any header field—one character in the transaction list, the timestamp, or the nonce—completely changes the resulting hash, making it a reliable “fingerprint” of the block’s contents.
A hash function is a one-way mathematical transformation: calculating the result from the input data is easy, but recovering the original data or finding another set of data with the same result is impossible except through random trial and error. Bitcoin uses the SHA-256 function twice (double SHA-256), while Ethereum uses Keccak-256. Both are cryptographically secure hash functions, meaning that no known mathematical method exists to “break” them faster than trying all possible variants.
Why each block stores the hash of the previous block
The previous block’s hash is stored in the header of every new block to link the blocks into an unbroken chain: if an attacker attempts to alter data in an old block, its hash changes and therefore no longer matches the value recorded in the next block. The chain then “breaks” at that point, which the network’s other nodes detect immediately.
This link is what gave blockchain its name—the “chain of blocks.” To secretly replace a transaction in a block already located in the middle of the chain, an attacker would have to recalculate that block’s hash and the hashes of all subsequent blocks faster than the rest of the network creates new ones. This requires controlling more than half of the network’s computing power (in PoW) or staked coins (in PoS) at the same time. Such an attack is known as a 51% attack, and for major networks such as Bitcoin or Ethereum, its cost is measured in billions of dollars, making it economically irrational.
A hash function has an avalanche effect: changing a single bit in the input data changes, on average, half of the result’s bits in an unpredictable way. Therefore, it is impossible to predict what hash will result from changing the input “slightly”—the only way to find a hash with the required properties, such as a specific number of leading zeroes as required by Proof of Work, is to blindly try different variants.
The hash length is fixed regardless of the input data volume: SHA-256 always produces a 256-bit string (64 characters in hexadecimal notation), whether it hashes a single transaction or an entire block weighing several megabytes. This property makes it possible to use a compact header hash as a “representative” of the entire block when transmitting it over the network and when constructing the Merkle root described in the section on block structure.
How miners create a block under Proof of Work
A miner collects transactions into a block and then changes the nonce value in the header millions or billions of times, recalculating the hash each time until finding a variant below the target difficulty threshold. Whoever finds such a hash first wins the right to add the block to the chain and claim the reward.
Difficulty is a numerical parameter that determines how small the resulting block hash must be for it to count as “found.” The lower the required value, the more zeroes must appear at the beginning of the hash in binary form, and the more attempts must be tried on average. In networks such as Bitcoin, difficulty is automatically recalculated every 2016 blocks (approximately every two weeks) so that the average interval between blocks remains around 10 minutes, regardless of how much computing power (hashrate) is connected to the network at a given time.
| Stage | What happens | Approximate time |
|---|---|---|
| Building a candidate block | The miner selects transactions from the mempool and creates the header | Fractions of a second |
| Nonce search | Mining equipment calculates hashes, changing the nonce on each iteration | From seconds to days—depending on the equipment’s computing power |
| Finding the hash | The hash falls below the target difficulty threshold | The “winning” moment—on average, once every ~10 minutes for the entire Bitcoin network |
| Block broadcast | The discovered block is sent to neighboring nodes for verification | Seconds for propagation across the network |
| Confirmation | Nodes verify the hash, signatures, and rules, then accept the block into the chain | Virtually instant after verification |
Modern mining equipment (ASICs) can try tens or hundreds of terahashes per second—that is, trillions of attempts every second—while the Bitcoin network as a whole exceeds several hundred exahashes per second (millions of trillions of hashes). Even at this speed, finding a suitable hash remains a matter of statistical chance: a specific miner cannot predict exactly when they will find a block; they can only increase their chances in proportion to their share of the network’s total computing power.
Why it is nearly impossible for a solo miner to find a block
If a miner’s hashrate accounts for, say, 0.001% of the network, they will find a block once every few years on average—and the actual result may take much longer. That is why the vast majority of miners join pools: the pool’s combined power finds blocks regularly, and the reward is divided among participants in proportion to their contribution. This makes income more predictable, even though it is smaller than the full block reward received when mining alone.
As soon as a miner or pool finds a suitable hash, they immediately broadcast the completed block to the network’s other nodes. Any delay creates the risk that someone else will find their own block first and publish it, leaving the losing version unused (this is discussed in more detail in the section on forks). After receiving a block, the other nodes do not trust it blindly: they recalculate its hash, verify that it is actually below the target threshold, confirm that all transactions inside it are valid and do not duplicate already confirmed transactions, and only then add the block to their copy of the chain and begin building the next block on top of it.
How validators create a block under Proof of Stake
A validator creates a block not by trying different hashes, but after the protocol selects them at random from all active validators, with a probability proportional to the amount of staked coins. The selected validator collects transactions, creates the block, and signs it with their private key. Other validators then verify the block before it is added to the chain.
In Ethereum, for example, time is divided into 12-second slots and epochs of 32 slots (approximately 6.4 minutes). For each slot, the protocol randomly selects one “proposer” validator, who collects transactions from the mempool and publishes a new block, as well as a committee of several hundred other “attesting” validators (attesters), who vote on the block’s validity during the same slot. The selection randomness is calculated in advance using the RANDAO algorithm and a network-wide source of pseudorandomness, making it practically impossible to predict who will be the proposer several epochs in advance.
How staking fundamentally differs from mining
The key difference is that a validator does not compete with other participants on computational speed — it is either selected for the slot or it is not, and in either case it uses comparably little energy to create the block. A miner consumes electricity on every attempt regardless of the outcome, while a validator risks not computing power but its own capital: if it acts dishonestly (signs two conflicting blocks or misses its duty), some or all of its staked coins will be confiscated by the protocol (slashing).
| Feature | Proof of Work (mining) | Proof of Stake (validation) |
|---|---|---|
| What determines the chance of creating a block | Share of the network’s total computational power | Share of the total amount of staked coins |
| What is spent on an attempt | Electricity for each hash attempt | Practically nothing — only the regular operating costs of the node |
| Penalty for dishonesty | Wasted energy; the block is rejected by the network | Slashing: confiscation of some or all staked coins |
| Minimum threshold for solo participation | Any amount of computing power (but income is almost zero with a small share) | 32 ETH for a solo Ethereum validator (or participation through a pool with a smaller amount) |
| What happens when a participant is idle | It simply does not find any blocks; the equipment remains idle without a penalty | A small penalty for missing the duty to attest to a block (leak) |
After the proposing validator publishes a block, the attesting committee checks whether it is valid and votes “for” or “against” during the same slot. If the block receives enough votes, it is considered accepted by the network; if the proposer fails to publish the block on time or the block turns out to be invalid, the slot remains empty, and the duty passes to the next selected validator in the next slot — the network does not stop, but simply continues without that block.
Staking pools and liquid staking services (such as Lido) make it possible to participate in validation with any amount below 32 ETH: the user deposits coins into a shared pool, the pool operator runs validators on behalf of all depositors, and distributes rewards in proportion to their contributions, minus the service fee. This dramatically expanded the number of people indirectly participating in block creation, but it also created the risk of excessive concentration of staked coins in the hands of a few large providers.
Other networks implement Proof of Stake in different ways: in Solana, synchronized “time” through Proof of History is taken into account in addition to stake, allowing blocks to be created in fractions of a second, while Cardano uses the Ouroboros algorithm, in which validators (“slot leaders”) are also selected by stake, but the epochs and selection rounds are organized somewhat differently. The general principle is the same everywhere: the right to create a block is proportional to a participant’s economic stake, rather than the physical power of their equipment.
How long does it take to create a single block
Block creation time is the target interval built into the protocol: around 10 minutes for Bitcoin, around 12 seconds for Ethereum, and fractions of a second for faster networks such as Solana. It does not depend on how many transactions need to be processed: the protocol keeps this interval stable regardless of network load.
In Proof of Work networks, block time is regulated through automatic difficulty adjustment: the greater the total computational power connected to the network, the faster blocks are found on average, so the protocol periodically raises the difficulty threshold to bring the interval back to its target value, and lowers it when miners shut down en masse (for example, due to a sharp drop in the coin’s price or rising electricity costs). Bitcoin adjusts its difficulty every 2016 blocks, while most derivative networks use a similar, though not identical, approach.
In Proof of Stake networks, the interval between blocks is usually fixed more rigidly because it does not depend on a computational race, but is determined by the slot length specified in the protocol: if the selected validator fails to publish a block on time, the slot simply remains empty rather than “shifting” — the network’s overall rhythm does not change as a result.
It is important to distinguish between average block time and actual block time: due to the probabilistic nature of mining, individual Bitcoin blocks may be found either in a minute or in half an hour — a statistical fluctuation that evens out only over longer periods. In Proof of Stake, the variation is significantly smaller precisely because the slot is fixed in time rather than dependent on luck in trying hashes.
What happens to a block after creation: confirmations and finalization
After a block is created, it is broadcast across the network, other nodes verify its validity and add it to their copy of the chain, and each subsequent block built on top of it counts as another “confirmation.” The more confirmations a block accumulates, the lower the probability that it will be replaced — and after finalization in modern Proof of Stake networks, the block becomes mathematically irreversible rather than merely statistically unlikely to be reversed.
Verification of a new block by other nodes is not based on taking anyone’s word for it: each full node recalculates the block’s hash and confirms that it complies with the difficulty rules, checks the digital signatures of all transactions inside it, verifies that no coin has been spent twice, and confirms that the block correctly references the previous one. Only after this independent verification does the node accept the block and begin propagating it further — making it impossible to forge a block centrally, because an attacker would have to deceive not one node but the majority of the network simultaneously.
| Network / context | How many confirmations are considered safe | Why exactly this many |
|---|---|---|
| Bitcoin, small transfer | 1–2 confirmations | The risk of reversing a small amount usually does not justify the cost of an attack |
| Bitcoin, large amount or exchange | 6 confirmations (~1 hour) | An industry standard that reduces the risk of a chain reorganization to nearly zero |
| Ethereum before finalization | ~12–15 blocks | The block can still be displaced by a longer competing branch |
| Ethereum after finalization | 2 epochs (~12.8 minutes) | From this point onward, the block is technically irreversible as long as the network operates honestly |
Finalization provides a stronger guarantee than simply accumulating confirmations: in modern versions of Ethereum, a block is considered finalized when at least two-thirds of all staked coins in the network have voted for it over two consecutive epochs. Reversing a finalized block would mean that at least one-third of the network’s total staked amount would have to vote knowingly incorrectly—and this automatically triggers slashing on a scale that makes the attack economically suicidal for the attackers.
Why you should not trust a transaction immediately after one confirmation
Until a block has accumulated enough confirmations (or has been finalized), a chain reorganization (reorg) is theoretically possible: a longer alternative branch can displace the block that already contains the transaction. For large amounts and irreversible actions (for example, exchanging cryptocurrency for fiat outside an exchange), you should wait for the number of confirmations accepted by the specific network rather than trusting the transaction as soon as it first appears in a block.
The situation in which two blocks are created almost simultaneously and briefly form two parallel chain branches is examined in the next section—it is a normal part of how a decentralized network operates, not a malfunction.
Why two blocks can appear simultaneously and what a fork is
Two blocks can appear almost simultaneously if two miners find a suitable hash within a fraction of a second of each other, or if two validators publish competing versions of a block for the same slot because of network delays. For a short time, two parallel versions of the chain exist, but the conflict is resolved automatically: the branch that continues to grow faster wins, while the shorter one is simply discarded.
This situation is called a fork or a temporary chain split. It does not occur because of a protocol error, but because of the physical speed at which information spreads: while a block is “traveling” across thousands of nodes around the world, another network participant may manage to find or publish their own block at the same height without knowing about the first one. Both blocks exist in parallel at different nodes for some time, until the network converges on a single consensus.
How the network decides which of the two branches is “correct”
Proof of Work networks follow the longest-chain rule (more precisely, the chain with the greatest total accumulated difficulty): nodes always consider canonical the branch that required more total computational work to create, and as soon as one of the competing blocks is extended—that is, someone finds the next block on top of it—the entire network switches to this longer branch.
Proof of Stake networks, including Ethereum, use a fork-choice algorithm that is similar in principle but more formalized (LMD-GHOST): each validator votes for the branch they consider correct, and the branch with the greatest total voting weight wins as canonical, rather than simply the branch with the most blocks.
| Situation | What happens to the “losing” block | What happens to the transactions inside it |
|---|---|---|
| Orphan block (Bitcoin) | Discarded by the network; it is not included in the main chain | They return to the mempool and wait to be included in the next block |
| Uncle block (Ethereum before PoS) | It is not included in the main chain, but was partially accounted for by the protocol | The transactions were moved to the main chain in a separate block |
| Chain reorganization (reorg) | One or more recent blocks are replaced by a longer branch | Transactions without duplicates on the new branch return to the mempool |
The block that lost this race is called an orphan block: it is valid under all the rules but is not part of the final chain because the network chose its competitor. The miner who found the orphan block receives no reward for it—the work performed effectively disappears, which is one of the arguments for joining mining pools: a pool has a higher chance of ending up on the “winning” side of a fork thanks to its greater combined hash power.
Natural forks caused by network delays should be distinguished from hard forks—deliberate changes to the protocol rules after which old and new nodes stop understanding one another and the network may split into two independent coins (as happened, for example, with Bitcoin and Bitcoin Cash). These are different phenomena: a temporary fork caused by two blocks being found at the same time is resolved by the network on its own within minutes, whereas a hard fork is a conscious community decision to change the rules.
Who pays for block creation and where the reward comes from
The entire network effectively pays for block creation: part of the reward comes from the new issuance of coins, which the protocol creates “out of thin air” according to predetermined rules, while another part consists of the fees paid by users whose transactions were included in the block. The balance between these sources changes over time.
In Bitcoin, the block reward was initially 50 BTC and is halved every 210,000 blocks (approximately once every four years)—this event is called the halving. After the 2024 halving, the reward is 3.125 BTC per block, and by the mid-2030s it will fall below 1 BTC. When the last of the 21 million coins is mined around 2140, issuance will cease completely, and miners’ rewards will consist solely of transaction fees.
Ethereum uses a different model: after the transition to Proof of Stake, issuance became variable and is calculated based on the total number of staked coins. Since 2021, part of the fees (the base fee) has not gone to the validator but has instead been burned permanently. During periods of high network usage, burning can exceed new issuance, in which case the total ETH supply temporarily decreases rather than grows.
Transaction fees are ultimately paid by the sender of the transaction, not by some abstract “network”: by specifying the fee amount in a wallet, the user directly determines part of the reward for the future block producer. The more competition there is for block space at a given moment, the higher the market price of that fee—as with any other auction for a limited resource.
As the share of issuance in miners’ and validators’ rewards declines, fees become increasingly important as the main incentive for maintaining the network. This is a key question for the long-term economic sustainability of Proof-of-Work networks such as Bitcoin: if the volume and price of transaction fees do not grow sufficiently by the time issuance has almost completely disappeared, miners may have less economic incentive to continue contributing computing power to secure the network.
What can go wrong when creating a block
When a block is created, one of four scenarios most commonly goes wrong: an invalid transaction is accidentally or deliberately included in the block and it is rejected by the network; the block becomes an “orphan” after losing a fork; the network is briefly delayed due to congestion or an attack; or an attacker attempts a 51% attack to rewrite history. All of these scenarios are accounted for by the protocol and do not compromise data integrity for honest participants.
An invalid block—a block that violates at least one consensus rule (an invalid transaction signature, double spending, an incorrect hash, or exceeding the size limit)—is simply rejected by the other network nodes without any additional mechanism: a node that receives such a block does not relay it and does not add it to its copy of the chain. The creator of the invalid block receives no reward and loses the resources invested in creating it.
Proof-of-Work risks
A 51% attack, in which a single miner or pool temporarily controls most of the network and can rewrite recent blocks, as well as the risk of excessive hash rate concentration in a few large pools.
Proof-of-Stake risks
Long-term downtime affecting a significant share of validators, a finalization attack with control of one-third of the staked coins, and concentration of stake in large pools such as centralized exchanges.
A 51% attack is the most widely discussed scenario: if a single participant gains control of most of the network’s computing power (PoW) or staked coins (PoS), it could theoretically block other users’ transactions or attempt to rewrite several of the latest blocks (double spend). For large networks such as Bitcoin and Ethereum, the cost of such an attack is so high—the purchase or rental of equipment and electricity on a comparable scale, or the acquisition of one-third of all staked coins—that it makes no economic sense. In PoS, an attempt to cheat is also subject to automatic slashing. In practice, 51% attacks have occurred on smaller networks with low total hash rate, such as Bitcoin Gold and Ethereum Classic, where the cost of the attack was comparable to the potential gain.
What an ordinary user experiences during network failures
For an ordinary cryptocurrency holder, the consequences of network congestion or a temporary fork usually amount not to a loss of funds, but to a delay in transaction confirmation and a temporary increase in fees. The risk of an actual loss of money arises almost exclusively when relying on an unconfirmed transaction—for example, when accepting a payment without waiting for a sufficient number of confirmations.
Delays in block propagation across the network are another source of failures: if a node has poor connectivity with the rest of the network (slow internet, geographical remoteness, or an overloaded node), it may learn about new blocks later than others and temporarily build on an outdated version of the chain. This does not affect the blockchain’s final integrity—as soon as connectivity is restored, the node synchronizes with the network and accepts the current version of the chain, discarding everything built on the outdated branch.
Frequently asked questions about block creation
Can an ordinary person create a block without specialized equipment?
In large networks such as Bitcoin, practically not: competition among miners makes the chance of finding a block on an ordinary computer vanishingly small. In Proof-of-Stake networks such as Ethereum, it is enough to stake the required amount of coins (32 ETH solo or less through a pool) without purchasing specialized equipment.
What happens if two blocks are found at the same time and both are valid?
The network will temporarily split into two branches, but only one of them will continue to grow—the one that receives the next block on top first. The losing block becomes an orphan block and is not included in the final chain, while its transactions return to the mempool for possible inclusion again.
Can a block be created without a single transaction inside it?
Yes, an empty block is valid: it still contains a special transaction awarding the creator a reward (the coinbase transaction in Bitcoin), even if the block contains no user transfers. This happens rarely—usually because of a miner’s technical failure or because the mempool is temporarily empty.
Why do different blockchains have different block creation times?
Each protocol chooses its own balance between speed and security during design: a shorter interval speeds up transaction confirmation but increases the risk of temporary forks due to delays in block propagation across the network, while a longer interval reduces this risk at the cost of slower confirmations.
Can the block creation process be seen in real time?
Yes, specialized blockchain websites (block explorers)—such as mempool.space for Bitcoin or Etherscan for Ethereum—show the state of the mempool, newly found blocks, and which miner or validator created them, almost in real time.
What is a coinbase transaction, and how does it differ from an ordinary one?
A coinbase transaction is the first transaction in every Bitcoin block. It does not transfer coins from one user to another, but creates new coins “out of thin air” as a reward for the miner, while also collecting all transaction fees from that block for the miner. It has no sender—only a recipient.
These questions most often arise after the reader has already understood the basic mechanism: they concern edge cases and practical observations that do not fit into the logic of a step-by-step explanation, but regularly come up when first exploring blockchain explorers or attempting to assess independently whether it is worth participating in mining or staking with the available equipment and capital.