IN THE STORY
The team has a trusted manifest of the correct pieces of a file. One received piece has been damaged. No actual network is involved.
The idea
A dictionary associates a key with a value. Here the key is a piece number and the value is its expected fingerprint. items lets the loop visit both. We keep a separate received dictionary and compare each piece with the trusted manifest. Counting matches prevents a program from claiming success after checking only one piece.
Your mission
Complete the final comparison. Release the copy only when the count of verified pieces equals the count of expected pieces.
Replace ____ with the missing expression, then choose Run code. Match the expected output before trying your own changes.
Before you run it
Why is it wrong to print “Complete” after any one piece passes?
A little help?
Hint 1: a nudge
len returns the number of entries in the manifest.
Hint 2: a closer look
Compare verified == len(expected).
How the answer works
The damaged middle piece fails. Change it to IS and all three pass. This is verification against a trusted baseline, not virus removal or proof of identity.
This replaces the code in the editor. Save your version first if you want to keep it.
Make it yours
In Build Game Two, run genesis_recovery.py. Retry the damaged copy, then release the verified copy. Test a missing piece too.