FITS Checksum Proposal
Rob Seaman, William Pence, Arnold Rots

TL;DR
This paper proposes a checksum keyword for FITS files that enables quick verification of data integrity by ensuring the accumulated 32-bit 1's complement checksum equals negative zero, helping detect modifications or corruption.
Contribution
It introduces the CHECKSUM keyword for FITS headers, defining a method to verify data integrity using 1's complement checksum calculations.
Findings
Provides a reliable method for integrity verification of FITS HDUs
Enables quick detection of data corruption or modification
Uses 32-bit 1's complement checksum for simplicity and speed
Abstract
The checksum keywords described here provide an integrity check on the information contained in FITS HDUs. (Header and Data Units are the basic components of FITS files, consisting of header keyword records followed by optional associated data records). The CHECKSUM keyword is defined to have a value that forces the 32-bit 1's complement checksum accumulated over all the 2880-byte FITS logical records in the HDU to equal negative 0. (Note that 1's complement arithmetic has both positive and negative zero elements). Verifying that the accumulated checksum is still equal to -0 provides a fast and fairly reliable way to determine that the HDU has not been modified by subsequent data processing operations or corrupted while copying or storing the file on physical media.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Advanced Data Storage Technologies
