The entry
The checks
The exact bytes hashed
Recompute it anywhere: this text, SHA-256, hex lowercase. That is the whole algorithm.
What this page proves, and what it does not
It proves the entry you are reading hashes to the fingerprint published for it, and that a closed entry still hashes, in its reconstructed open state, to the fingerprint published before the outcome existed. A changed price, a changed time, a quietly improved result: all of them break the match.
It does not prove the fingerprint was published when it claims. That takes an external anchor, and until an OpenTimestamps proof for the record is published, a rewritten history could reprint a consistent record. The numbering is the other half: entries are consecutive, so a deleted entry leaves a visible hole.