HelpContactFor teachers and institutes
>_StemPy Lab
Mock TestsClasses

>_StemPy Lab

Learn. Solve. Code the solutions. Test yourself.

Live examsFree mock exams, timed and rankedEveryone starts together, and your score and rank come the moment it ends.See the exams →

Learn

  • Physics
  • Chemistry
  • Mathematics
  • Biology
  • Python Programming
  • Statistics & Data Science
  • Computer Science
  • Classes
  • Groups

Practice

  • Problems
  • Quizzes
  • Mock Tests
  • Prepare for an Exam
  • Question Sets
  • Exams
  • Certificates
  • Python Labs
  • AI Practice Generator
  • Student-Created Tests

Community

  • Discussions
  • Resources
  • Notes
  • Glossary
  • Blog

Account

  • Log in
© 2026 senLearn. All rights reserved.HelpFor SchoolsAboutContactPrivacy PolicyTerms of UseRefund Policy
  1. Problems
  2. /A blockchain has 56 blocks. A new block is added to the honest chain every 10 minutes…
HardComputer ScienceHigh School (9–10)Computer Science › The Internet, the Web and Digital CurrencyNumericalConceptualIGCSE

A blockchain has 56 blocks. A new block is added to the honest chain every 10 minutes…

StemPy LabContributed by StemPy Lab

Try it on paper first. A hint, the key idea and the worked solution are here when you need them.

A blockchain has 565656 blocks. A new block is added to the honest chain every 101010 minutes. Adding a block, or working out a new hash for one, needs a difficult puzzle to be solved, which takes the attacker 101010 minutes per block as well.

An attacker wants to change a payment in block 505050.

  1. How many blocks must the attacker work out again, counting block 505050?
  1. How many minutes does that take the attacker?
  1. How many new blocks has the honest network added in that time? Explain why the attacker cannot catch up.

Check your answer

Work it out on paper, then type your number. The answer itself stays hidden.

Need a reminder? The key ideaShowHide

A payment is sent to a network of computers (nodes). They check it, group it with others into a new block with a time-stamp and the previous hash, add the block to the chain and update every copy. Every payment stays in the chain, so units can be tracked back. A version is accepted when more than half of the NNN copies hold it:

h=⌊N2⌋+1.\displaystyle h = \left\lfloor \dfrac{N}{2} \right\rfloor + 1.h=⌊2N​⌋+1.

The worked solution

Have you tried it?

Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.

Step 1. The blocks. r=56−50+1=7r = 56 - 50 + 1 = 7r=56−50+1=7 blocks.

Step 2. The time. 7×10=707 \times 10 = 707×10=70 minutes.

Step 3. The honest network. In 707070 minutes it adds 70÷10=770 \div 10 = 770÷10=7 new blocks. The chain is now 636363 blocks long.

Step 4. Why the attacker loses. After 707070 minutes the attacker has a changed chain of 565656 blocks, while the honest chain has 636363. The attacker is still 777 blocks behind, and both sides add blocks at the same speed, so the gap never closes. On top of that, the attacker's version would have to be on more than half of the copies.

Answer: (a) 777 blocks. (b) 707070 minutes. (c) 777 blocks; the gap stays the same, so the attacker never catches up.

Log in to save this for later
← All Problems
← Kemal pays Dana 9 units of a digital currency that uses a blockchain…Part of a blockchain holds these payments, oldest first… →
More onComputer Science › The Internet, the Web and Digital Currency

Discussion (0)

Log in to join the discussion.

Loading…

More on this topic

  1. Part of a blockchain holds these payments, oldest first…Hard
  2. Kemal pays Dana 9 units of a digital currency that uses a blockchain…Medium
  3. A blockchain is copied on 40 computers in a network…Medium
  4. A student designs a "blockchain" in which each block holds only its data, a time-stamp and its own…Hard
  5. A blockchain has 9 blocks. A person changes the amount of a payment in block 4…Medium
All problems on this topic →