Your system is set to reduce motion, so the mining arena is paused. This screen has a slowly orbiting camera, streaks of light, and a brief glow each time a block is found, about once every seventy seconds.
This page turns proof-of-work mining into something you can watch. A chain of glowing blocks recedes into the distance, each one coloured by the mining pool that found it. In front, the next block is being forged while six pools fire streaks of hash attempts at it from pylons in a ring. Every minute or so one pool finds a valid hash: a beam shoots from its pylon, the block flashes in its colour, and it slides onto the chain. Now and then two pools find a block at almost the same moment and the chain forks until the next block decides which branch survives. Every 32 blocks the difficulty retargets, and large "whale" transfers fly into the block being built. Click ⛶ FULLSCREEN and it fills the screen.
No. It is an animation, and the bar under it says SIMULATION. The coin, called FRG, does not exist. Its network, the six pools (ANVIL, HELIOS, NOVAMINE, OBSIDIAN, TITANHASH, and KRYO), the addresses, the blocks, and every transaction are invented and drawn in your browser. Nothing is mined, nothing is actually hashed, and the page connects to no blockchain, wallet, or pool. It does not use your computer's processor for mining.
The mechanism on screen is modelled on Bitcoin, the first and best-known proof-of-work currency, and the section on how proof-of-work mining really works below explains each part. Some things are changed for the screen: blocks come about every 70 seconds instead of every 10 minutes, and forks happen far more often than on the real network. Nothing on this page is investment advice or a recommendation to buy or mine any coin.
Moments worth seeing in the first part of the cycle (seek with the bar or use ?t=):
| Time | Seconds | What happens |
|---|---|---|
| 00:00:14 | 14 | First block of the cycle, #812,346 |
| 00:01:35 | 95 | First whale transfer: 36,627 FRG flies into the block |
| 00:07:10 | 430 | Block #812,352 triggers the first retarget: difficulty up 2.62% to 94.83 T |
| 00:30:03 | 1803 | OBSIDIAN finds block #812,372 |
| 00:30:09 | 1809 | TITANHASH finds a competing #812,372; the chain forks |
| 00:31:15 | 1875 | ANVIL finds #812,373 on OBSIDIAN's branch; TITANHASH's block is orphaned |
| 00:42:58 | 2578 | Second retarget: up 2.09% to 96.81 T |
| 00:54:26 | 3266 | Second fork, ANVIL against TITANHASH; ANVIL's branch wins at 55:19 |
Over the full ten-hour cycle there are 516 blocks (70 seconds apart on average), 19 forks, 16 difficulty retargets, and 73 whale transfers. The difficulty wanders between 93.68 T and 107.71 T. ANVIL, the biggest pool, finds the most blocks (105) and KRYO, the smallest, the fewest (69), but OBSIDIAN ends up ahead of the larger NOVAMINE, as real luck sometimes allows.
?t= and the number of seconds to the address, for example /crypto-mining?t=1795 for the first fork. Minutes and hours also work: ?t=7m for the first retarget, or ?t=1h30m.The page draws at the full resolution of your screen, up to 4K. On a slow computer it lowers the resolution by itself to keep the motion smooth.
Background screens for films, series, and music videos with a trading floor, a crypto start-up, a server farm, or a heist; b-roll for videos and talks about blockchains; classroom and workshop lessons on hashing, consensus, and why proof of work is slow and costly by design; stream backdrops for technology and finance channels; and ambient displays for a hackathon, a meetup, or a themed event. For OBS setup as a browser source, see the streaming toolkit.
Bitcoin was described in a 2008 paper by an author using the name Satoshi Nakamoto, and its network started in January 2009. It solved a hard problem: how strangers who do not trust each other can agree on a single list of payments without a bank in the middle. Proof-of-work mining is the part of the answer this screen shows. The description below follows Bitcoin; other proof-of-work coins differ in details.
Transactions are grouped into blocks. Each block carries a short header that includes a fingerprint (hash) of the block before it, which links the blocks into a chain. Changing an old block would change its fingerprint and break every link after it, so the further back a block is, the harder it is to alter. The position of a block in the chain is its height, the number in the top bar and on each block here.
A hash function turns any input into a fixed-size number that looks random. Bitcoin uses SHA-256 applied twice, which is why the nonce scanner is labelled SHA-256D. The output is 256 bits, usually written as 64 hexadecimal characters. Changing a single character of the input gives a completely different hash, and there is no known shortcut for finding an input that gives a particular kind of output. The only way is to try inputs one after another.
To add a block, a miner must find a header whose hash, read as a number, is below a target set by the network. A smaller target means a hash that starts with more zeros, and it is harder to hit. The miner changes a field in the header called the nonce and hashes again, over and over. The nonce has only about 4.3 billion possible values, which modern machines run through in a fraction of a second, so miners also vary other parts of the block, such as an extra field in the reward transaction, and keep going. Real Bitcoin block hashes in the mid-2020s start with about nineteen zeros in hexadecimal, as the valid hashes on this screen do.
Mining is a lottery, not a race to the end of a task. Every hash has the same tiny chance of winning no matter how long a miner has been searching, so there is no progress to measure. The climbing bars in the pool race are a way of making the search visible, not something real miners see. A miner with twice the hashrate simply buys twice as many lottery tickets per second.
Checking a winning block is the opposite of finding one: anyone can hash the header once and see that it meets the target. That imbalance, very costly to produce and almost free to check, is the core idea of proof of work.
The network aims for one block every ten minutes on average. As miners join or leave, blocks would come faster or slower, so every 2,016 blocks (about two weeks) each node compares how long those blocks actually took with how long they should have taken, and moves the target to compensate. The change in one step is limited to a factor of four. The screen does the same thing on a smaller scale: every 32 blocks, with changes of a few per cent. Difficulty is usually quoted as a large number; the T on screen stands for trillion.
For one machine, or even one warehouse of machines, finding a block can take months or years of waiting. Miners therefore join pools that combine their hashrate and share the rewards. To measure each member's contribution, the pool sets its own, much easier target. Hashes that meet it are called shares: they are not good enough to win a block, but they prove that work was done, and the pool pays out in proportion. That is what the SHARE label in the nonce scanner marks. A few large pools find most blocks on the real network, which is why the concentration of hashrate is watched closely: anyone controlling a majority of it could rewrite recent blocks, an attack known as a 51% attack.
Blocks take a few seconds to spread around the world, so sometimes two miners find a valid block at the same height before hearing of each other's. For a while the network is split: some nodes build on one block, some on the other. The tie is broken by the next block. Nodes always follow the chain with the most accumulated work, so once one branch is longer, everyone switches to it. The losing block is commonly called an orphan, though stale block is the more precise term. Its reward is lost, and any of its transactions that are not in the winning block go back to the mempool. This is why exchanges and merchants wait for several confirmations, blocks built on top of the one holding a payment, before treating it as final; six is a common rule of thumb. Real stale blocks have become rare as the network has got faster, far rarer than the one every half hour on this screen.
New transactions wait in each node's mempool (memory pool) until a miner includes them. Blocks have a size limit, so when demand is high, miners pick the transactions that pay the highest fee for the space they take. Real Bitcoin fees are quoted in satoshis per virtual byte (sat/vB); the gr/vB on screen is an invented unit for the fictional coin. A typical full block holds a few thousand transactions, similar to the counts shown here.
The miner of each block pays itself a fixed block subsidy of new coins, plus the fees of every transaction in the block, through a special first transaction called the coinbase transaction. In Bitcoin the subsidy started at 50 coins and halves every 210,000 blocks, roughly every four years: it was 6.25 BTC from 2020, the figure this screen borrows, and 3.125 BTC since April 2024. Because of the halvings the total supply can never exceed 21 million bitcoin.
Proof of work is expensive on purpose: the security of the chain comes from the cost of the work needed to rewrite it. Mining today uses specialised chips called ASICs that do nothing but compute SHA-256, run in large facilities, and the network as a whole uses a great deal of electricity. That cost is the main criticism of proof of work. Some networks use a different approach called proof of stake, in which validators lock up coins instead of spending computing power; Ethereum switched from proof of work to proof of stake in September 2022.
| This screen (FRG, fictional) | Bitcoin | |
|---|---|---|
| Average time between blocks | about 70 seconds | about 10 minutes |
| Difficulty adjustment | every 32 blocks, up to ±4.5% | every 2,016 blocks, limited to a factor of 4 |
| Hash function | SHA-256D (in name only; nothing is hashed) | SHA-256 applied twice |
| Block subsidy | 6.25 FRG plus fees | 3.125 BTC plus fees since April 2024 |
| Forks | about every 30 minutes | rare |
| Network hashrate | about 570 to 660 EH/s | of the same order in the mid-2020s |
The whole ten-hour cycle is worked out in advance from a fixed random seed. Block times are drawn between 50 and 94 seconds, and the winner of each block is picked at random in proportion to each pool's share of the hashrate at that moment, so big pools win more often but not every time. Every 32nd block changes the difficulty by a random few per cent. Forks are placed every 22 to 33 blocks, with a second pool finding a rival block three to six seconds after the first and a coin toss deciding which branch the next block extends. Whale transfers are slotted in where they do not clash with a find. The arena is a simple 3D scene projected onto the screen with a slowly orbiting camera, and the glow comes from blending light sprites on top of each other. Because every frame is a function of the time alone, the page can jump anywhere in the cycle at once, and the same moment always looks the same.
No. It is an animation. Nothing is mined and nothing is actually hashed: the strings in the nonce scanner are random characters made to look like hashes. The page does not use your computer to mine, asks for no wallet, and connects to no blockchain or pool.
No. FRG, its network, the six mining pools, the addresses, the blocks, and the transactions are all invented for this screen. Any real coin or company with a similar name has nothing to do with it. Nothing on this page is investment advice or a recommendation to buy or mine anything.
They are a visual device. Real mining has no progress bar: each hash is an independent guess with the same tiny chance of success, so a miner who has searched for nine minutes is no closer than one who has just started. On screen each bar shows a pool's best attempt of the round, and only the pool that finds the block reaches 100%.
Ten hours. In that time 516 blocks are found, the chain forks 19 times, the difficulty retargets 16 times, and 73 whale transfers fly in. After ten hours the cycle starts again. The screen is calculated frame by frame rather than played from a recording, so it needs no download and never buffers.
Yes. Press N for the next event (a fork, a difficulty retarget, or a whale transfer) and B for the previous one, or drag the seek bar. To open the page at a given moment, add ?t= to the address with the number of seconds, for example ?t=1795 for the first chain fork.
Yes. It is free to use for videos, films, streams, presentations, classrooms, and events. Click FULLSCREEN, or add the page as an OBS browser source at 1920 × 1080 or 3840 × 2160; the scene is drawn at the full resolution of the source.
There is no full-screen flash and no strobing. About once every seventy seconds, when a block is found, the new block lights up white for under a second while a beam and a ring shoot out from the winning pool, and the winner's row in the pool race pulses for about a second and a half. Before a whale transfer, a gold square blinks in the mempool for six seconds. If your system is set to reduce motion, the page opens paused. See accessibility and visual effects for more.
Once the page and its fonts have loaded, the simulation makes no further network requests, so it keeps running if the connection drops. The optional VIDEO view streams from YouTube and needs a connection.
Put the stock exchange screen beside it for a trading floor, or the data centre screen for the server hall where the mining happens. The futuristic tech dashboard and the live cyber attack map fill out a network operations room, and the fake hacker terminal adds a command line for close-ups.