Record Integrity · 12 February 2026 · 9 min read

Why Document Hashing Matters in a Sealed Archive

Sealing an archive is meaningless without a verifiable way to prove a document has not changed since. Hashes do that quietly.

A sealed archive is only as trustworthy as its ability to prove that what is in it now is what was put in it then. Filenames, folder structures and access logs are useful but insufficient — any of them can be edited without changing the underlying document. Cryptographic hashes do the small, durable job of binding a record to a verifiable fingerprint, so the seal becomes provable rather than merely declared.

What A Hash Actually Does

A hash function takes a document and returns a fixed-length string that changes completely if even one byte of the document changes. The string is small, deterministic, and produced again on demand from the same input. Two files with the same hash are, for practical purposes, the same file; two files with different hashes are different files, regardless of how similar they look.

The hash itself is not secret. It is a public fingerprint that anyone can recompute from the document. Its usefulness is exactly that property: the archive can be checked by an independent party without revealing anything beyond what they are checking.

Sealing Is A Declaration; Hashing Is The Proof

Calling an archive sealed is straightforward. Demonstrating that the archive has not changed since it was sealed is the part that requires evidence. Without hashes, an archive's seal is a policy claim. With hashes recorded at the moment of sealing and verifiable any time afterwards, the claim becomes testable.

Each item in the archive is hashed at intake. The hash, the algorithm used, the timestamp and the operator are recorded in an index that is itself hashed. The archive then carries its own proof of integrity, not just an assurance that integrity was intended.

Which Hash And Why

Older hash functions — MD5, SHA-1 — are deprecated for integrity work because collisions have been demonstrated. Current practice uses SHA-256 or stronger, where no practical collision attack is known. The choice is not theoretical: a deprecated algorithm undermines the proof it was supposed to provide.

The algorithm used for each hash is recorded alongside the hash itself, so an archive sealed today is verifiable in the future even if the operative standard shifts. Migration to a stronger algorithm is itself a recorded event, with the old and new hashes preserved.

Verifying Without Re-Opening The File

A useful integrity check does not require the verifier to read the document. They recompute the hash from the file and compare it to the recorded value. If the two match, the document is unchanged. If they differ, the document has changed — which is information, even when unwelcome.

This matters in disclosure. A counterparty can verify that the document they have been given matches the one the archive holds, without anyone exposing additional material. Integrity is checkable without being intrusive.

What Hashing Does Not Do

A hash proves that a file has not changed; it does not prove that the file was true when it was created, that the signatory had authority to sign it, or that the events it describes occurred. Treating a hash as a substitute for substantive verification is a category error, and a common one.

The archive records what hashing is doing — binding intake to a verifiable fingerprint — and does not claim more. Substantive verification remains a separate exercise, on a separate part of the file, with its own evidence trail.

Hashing in the Sealed Archive

Element	What hashing provides	What it does not provide
Document integrity	Proof of no change since intake	Proof of original truth
Index integrity	Detection of edits to the catalogue	Authorisation of cataloguing
Disclosure	Verifiability without re-disclosure	Determination of relevance
Algorithm	Forward-compatible record of method	Eternal cryptographic strength
Operator	Attribution of the intake action	Verification of operator authority

Frequently asked questions

Does hashing make a document tamper-proof?

It makes a change to the document detectable. The file itself is not protected from alteration; the alteration is simply provable. That is what integrity work actually means in practice.

Which hash algorithm should be used?

Current practice uses SHA-256 or stronger. Older algorithms with known collision attacks are unsuitable for integrity work. The algorithm in use is recorded with each hash so future verification is unambiguous.

Can a counterparty verify a document without seeing the archive?

Yes. They recompute the hash on the document they have and compare it to the recorded value. Matching hashes confirm the document is unchanged; differing hashes indicate change, without revealing anything else.

Does a valid hash prove the document is truthful?

No. The hash proves the document has not changed since it was hashed. The truth of its contents is a substantive question handled on a separate part of the file with its own evidence.

What happens when hash standards evolve?

Migration to a stronger algorithm is itself recorded as an event. The original hash is preserved, the new hash is added, and the relationship between the two is documented so future verification works from either reference.

Hashing turns a sealed archive from a claim into a check. The archive can be verified, the seal can be tested, and the proof is portable — which is the entire point.