What does Verify disc after burning actually do to verify the data?

I imagine it is some kind of comparison between the original files and the files that have been burned on the disc, but does anybody know how it is really done at a low level?

I mean, does it create a hash of the source and destination content and then compares them? If it is so, does it store the hash of the burned content in RAM? Or does it save it in a temporary file on the hard drive? Is there a log file of what is going on?

Just curious to know exactly how this feature works :) And I am referring to Windows Image Burner.

2

2 Answers

Check out these MSDN pages on windows API for the IBurnVerification interface, and the IMAPI_BURN_VERIFICATION_LEVEL enum.

For data disks, it looks like in quick mode it doesn't checksum the entire disk, just a selection of sectors. It then makes sure that the API calls READ_DISC_INFO and READ_TRACK_INFO succeed against the new disk.

For full verification, it performs the above checks, and then does a full checksum on the last session on the new disk, against a checksum computed on the memory stream being burned. The checksums have to be stored in ram, but they are likely short lived values. Note that the comparison is against the disk image in RAM, not the source media itself, so if the source data did not read correctly, it will be written incorrectly. Verification will not detect this.

For music disks, it focuses on checking READ_TRACK_INFO and the disk Table of Contents, but does not perform a Checksum calculation. There is no full verification mode for music.

Frank nicely explained the Windows-specific verification. I’ll give a more general answer.

What does Verify disc after burning actually do to verify the data?

I mean, does it create a hash of the source and destination content and then compares them? If it is so, does it store the hash of the burned content in RAM? Or does it save it in a temporary file on the hard drive? Is there a log file of what is going on?

That is certainly one way that a comparison can be implemented: hash one file (hopefully with a sufficiently large—read low chance of collision algorithm), repeat for the other, and compare hashes. If that is how a verification is implemented, then you will be able to see the drive-LED flash for a while, then the CD/DVD-LED flash for a while.

Another way to implement the verification is to read a block of one file, then the same block from the other file, compare them, then repeat until the end of the file is reached. In this case, you will see the LEDs of the two drives alternating back and forth.

Of course, if the the hard-drive and optical drive don't have LEDs, then it won’t be as obvious, but you can still see it with something like ProcessMonitor because it will log a series of reads from one, then the other either in a single, big burst each or alternating, small bursts.

I imagine it is some kind of comparison between the original files and the files that have been burned on the disc, but does anybody know how it is really done at a low level?

Actually, all it really does is to flush the drive cache so that the comparison function is reading the data from the actual disc instead of from the memory cache. Obviously this is a critical step because if the verification is done from cache, then it does not represent what is actually on the disc, so corruption can easily slip through.

You can see whether a comparison is done from the drive or from the cache in RAM by how fast it occurs. If you manually do a simple comparison (e.g., with WinDiff or WinMerge or by hashing them with a hashing tool), you will notice that the comparison happens much faster than expected because it is reading the files from memory cache. You must flush the cache to force it to read from the actual disc. For optical drives (and other removable media like flash-drives and memory-cards, simply ejecting the drive is enough to flush the cache, but for hard-drives, it is not nearly as simple (though usually that doesn’t matter because the new copy is the one you want to test).

4

Your Answer

Sign up or log in

Sign up using Google Sign up using Facebook Sign up using Email and Password

Post as a guest

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

You Might Also Like