Learning simulation

How does Bitcoin mining work?

Miners vary block data until the hash meets the network target. This performs a real hash search in your browser, without a wallet, market data, or profitability estimates.

Number of leading zeroes
4zeroes
About 65.5K attempts on average
Learning target: hash begins with 0000
Current double SHA-256The hash will appear after the first attempt

Nonce: 0

Long searches increase device load and battery use.

Recent attempts

real nonces and hashes

The latest verified attempts will appear here after you start.

Learning block 0

Start of the chain

Previous block hash
Beginning of the learning chain
Lesson entry
Foundation: hashes and links
Lesson entry
Lesson data: A
Hash: 9f4a7c2b618d…d76f09

Learning block 1

Previous block

Previous block hash
9f4a7c2b618d…d76f09
Lesson entry
Lesson data: B
Lesson entry
Linked to block 0
Hash: 4c1de8a3b729…f80c57

Learning block 2

Next block

Previous block hash
4c1de8a3b729…f80c57
Lesson entry
Lesson: Proof-of-Work
Lesson entry
The nonce changes on every attempt
Nonce: 0Hash: waiting for the search
Ready for the learning search

Block chain

Every found block extends the chain

After a successful search, the block remains in this tab and the next block receives its hash. Reloading the page starts a new learning chain.

FAQ

Frequently asked questions about Bitcoin mining

What is Bitcoin mining in simple terms?

Miners assemble candidate block data and repeatedly change the nonce to produce a hash below the network target. A valid candidate is shared with other participants, who independently verify it against Bitcoin's rules.

What is a nonce, and why do miners change it?

A nonce is a changeable number in a block header. Even a small data change produces a completely different SHA-256 hash, so miners vary the nonce and other fields until the result meets the target.

Why does this simulation use leading zeroes?

Bitcoin compares the hash with a numerical target. Requiring leading zeroes is a visual learning simplification: the more zeroes required, the smaller the share of valid hashes and the more attempts are usually needed.

Why can a block be found earlier or later than the estimate?

Every attempt is independent, so a valid hash may appear immediately or only after a long search. The displayed time is a probabilistic average based on the measured browser speed, not a countdown or a guarantee.

Why is browser speed not comparable with an ASIC?

A browser performs this learning search on a general-purpose processor while also rendering the interface. An ASIC is specialised hardware for Bitcoin hashing, with fundamentally different architecture, speed, and energy use.

What happens after a block is found?

On the Bitcoin network, other nodes verify the Proof-of-Work and every other block rule. In this simulation, the result is added only to the local learning chain in this tab. It is not sent to Bitcoin and is not a mined network block.

How is difficulty related to real mining energy use?

A stricter target requires more calculations on average. Real energy use also depends on hardware efficiency, cooling, operating conditions, and other factors that this browser demonstration does not model.

Can this simulation estimate mining profitability?

No. It does not include the BTC price, block reward, pool fees, electricity tariff, equipment cost, or changes in network difficulty. It explains Proof-of-Work mechanics and does not forecast income or payback.

Crypto assets involve risk. This material is educational and is not investment advice.