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. /Kemal pays Dana 9 units of a digital currency that uses a blockchain…
MediumComputer ScienceHigh School (9–10)Computer Science › The Internet, the Web and Digital CurrencyConceptualIGCSE

Kemal pays Dana 9 units of a digital currency that uses a blockchain…

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.

Kemal pays Dana 999 units of a digital currency that uses a blockchain. Describe, as numbered steps, how the payment is checked and recorded, from the moment Kemal sends it to the moment it cannot be altered. Then explain how someone could later track where Dana's 999 units came from.

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.

A model answer.

  1. Kemal's digital wallet sends the payment to the network of computers that keep the blockchain.
  2. The computers check that it is valid: the records in the chain show that Kemal owns at least 999 units.
  3. The payment is grouped with other payments into a new block, with a time-stamp and the hash of the last block.
  4. The block's own hash is worked out, and the block is added to the end of the chain.
  5. Every computer in the network adds the block to its copy. The payment is now a time-stamped record that cannot be altered.

Tracking. The payment stays in the chain for ever. Anyone with a copy can find it, and then look further back for the payments that gave those units to Kemal, and so on.

How it is marked. One mark for each step in a sensible order, and one for the tracking.

Log in to save this for later
← All Problems
← A blockchain is copied on 40 computers in a network…A blockchain has 56 blocks. A new block is added to the honest chain every 10 minutes… →
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. 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 →