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 student designs a "blockchain" in which each block holds only its data, a time-stamp and its own…
HardComputer ScienceHigh School (9–10)Computer Science › The Internet, the Web and Digital CurrencyConceptualIGCSE

A student designs a "blockchain" in which each block holds only its data, a time-stamp and its own…

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 student designs a "blockchain" in which each block holds only its data, a time-stamp and its own hash. It does not store the hash of the previous block.

  1. A person changes the data in block 333 and works out a new hash for block 333. Explain why nobody can tell from the chain that anything was changed.
  1. Explain how storing the previous block's hash would let the change be seen.
  1. In a real blockchain, explain why the person would also need to change every later block.
Need a reminder? The key ideaShowHide

A blockchain is a digital ledger: a time-stamped series of records that cannot be altered. Each block holds its data, a time-stamp, the hash of the previous block and its own hash. A tiny change in the data gives a completely different hash. If block kkk of nnn is changed, every block from kkk to nnn needs a new hash:

r=n−k+1.\displaystyle r = n - k + 1.r=n−k+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.

(a) Each block checks only itself. Block 333 now has new data and a matching new hash, so it looks correct. Block 444 holds nothing about block 333, so nothing disagrees. The change cannot be seen.

(b) If block 444 stores the hash of block 333, it still holds the old hash. The new hash of block 333 no longer matches it, so anyone who checks the chain sees that block 333 was changed.

(c) To hide that, the person must put the new hash of block 333 into block 444. That changes the data of block 444, so block 444 gets a new hash, which must go into block 555, and so on to the end. Every later block must change.

The program shows this: it builds three linked blocks, changes block 1 and works out its new hash, then checks each link.

Log in to save this for later
← All Problems
← A blockchain has 9 blocks. A person changes the amount of a payment in block 4…A blockchain is copied on 40 computers in a network… →
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. A blockchain has 56 blocks. A new block is added to the honest chain every 10 minutes…Hard
  3. Kemal pays Dana 9 units of a digital currency that uses a blockchain…Medium
  4. A blockchain is copied on 40 computers in a network…Medium
  5. A blockchain has 9 blocks. A person changes the amount of a payment in block 4…Medium
All problems on this topic →