Drivechain ObservatoryConnecting…Waiting for data.
  1. 1What is a drivechain?
  2. 2Blocks: the heartbeat
  3. 3Slots and sidechains
  4. 4Creating a sidechain
  5. 5Deposits and the treasury
  6. 6Withdrawals by miner vote
  7. 7Blind merged mining
  8. 8How we know
Concept 2 of 8

Blocks: the heartbeat

Everything in a drivechain happens one L1 block at a time.

3 min read

A chain of blocks

Transactions on L1 are grouped into blocksBlockA batch of transactions added to the chain by a miner, on average every ten minutes.. Miners compete to find the next block using proof-of-work, and the network adjusts the difficulty so a new block appears about every ten minutes on average.

Every block has a heightHeightA block's position in the chain: the number of blocks before it. (how many blocks came before it) and a hashBlock hashA block's unique fingerprint. Each block also records the hash of its parent, which links the chain together., a unique fingerprint. Each block also records its parent's hash, which is what chains them together.

Blocks linked by their parent hashEach block stores the hash of the block before it, so changing an old block would break every link after it.Height 100hash: 9f2c…parent: …transactionsHeight 101hash: 41ab…parent: 9f2c…transactionsHeight 102hash: c07e…parent: 41ab…transactionsHeight 103hash: 5d19…parent: c07e…transactionsEach block points to its parent. Newer blocks are added on the right.

Why blocks matter for drivechains

Every drivechain action is written into an L1 block: proposing a sidechain, voting on it, depositing, voting on a withdrawal, paying it out. Votes are counted once per block, and deadlines are measured in blocks, not in days.

Blocks are the clock of a drivechain. "Too old" means "too many blocks ago", whatever time the wall clock shows.

Live on Betanet

The latest L1 blocks

UnknownThis value is missing, conflicting, or was read while the chain moved. Nothing is guessed to fill the gap.

Loading live data…

When the chain changes its mind

Sometimes two miners find a block at almost the same time and the network briefly splits. The branch with more accumulated work wins, and the blocks on the other branch drop out of the chain. This is a reorganizationReorganization (reorg)When the network switches to a competing branch with more work, so some recent blocks stop being part of the chain.. The effects of those blocks, including any drivechain votes, are undone; their transactions may be included again in later blocks.

The monitor keeps such blocks on record instead of deleting them, so you can still inspect what happened.

Live on Betanet

Competing branches

UnknownThis value is missing, conflicting, or was read while the chain moved. Nothing is guessed to fill the gap.

Loading live data…

Go deeper: block time vs. the time we saw it

A block's timestamp is written by its miner and may differ by a few minutes from real time. The monitor separately records when it first observed each block. That is why a block can appear to be "seen" before its own timestamp.

Each block's work is added to its parent's to give the chain's accumulated work. That total, not the number of blocks, decides which branch wins.

Check yourself

A withdrawal must collect its votes before it is "too old". How is its age measured?

Ask an AI assistant about this concept

Opens your assistant with a question about this concept and its sources already written. AI answers can be wrong. Your question goes to the assistant you choose, not to us.