Working definition
A cryptographic commitment workflow canonicalizes a record, hashes the exact bytes, and binds the digest to an external timestamp or signed registry entry. Later disclosure can prove that the opened record matches the commitment, provided the canonicalization and identity protocol are preserved.
Notation
digest = SHA-256(canonical(record))verify(opening) = committed digestAssumptions
- Canonical serialization is deterministic.
- Hash and signature algorithms are appropriate.
- Timestamp and identity controls are independently auditable.
Invariants
- Identical canonical bytes produce identical digests.
- Any byte change should change the digest with overwhelming probability.
- Verification does not require trusting the opening party.
Reproducible procedure
- Validate and canonicalize the full record.
- Hash, sign, and timestamp the digest.
- Publish the commitment before outcomes and preserve the opening bundle.
Error and boundary controls
- A commitment cannot reveal omitted fields.
- Weak identity controls permit attribution disputes.
- Hashing false data preserves false data.
What this does not establish
Immutability prevents hindsight editing; it does not establish that the committed prediction is accurate or the underlying theory is valid.
Explicit applications
2 cross-domain bridges
Reproducibility digest
Bind exact inputs, versions, conventions, and outputs to a deterministic record digest.
Inputs
- canonical fact bundle
- software version
- calculation conventions
Outputs
- digest
- canonical payload
- verification metadata
Transformation: Canonicalize the record and compute a standard cryptographic digest.
Limit: The digest proves byte-level integrity, not truth of the submitted time or location.
Open connected system →Pre-outcome forecast commitment
Lock hypotheses, features, rules, horizons, outcomes, and analysis plans before results are observed.
Inputs
- forecast record
- protocol version
- identity and timestamp evidence
Outputs
- public digest
- sealed payload
- later verification bundle
Transformation: Canonicalize, hash, sign, and publish the commitment.
Limit: Pre-registration prevents some hindsight bias but cannot guarantee adherence or data quality.
Open connected system →Authoritative references
- [1]FIPS PUB 180-4: Secure Hash Standard · National Institute of Standards and Technology
Establishes: Standard secure hash algorithms that map messages to fixed-length digests and support integrity controls when used in an appropriate protocol.
Boundary: A digest can detect changed bytes relative to a committed value; it does not prove that the original input was truthful, complete, or independently observed.
- [2]RFC 8785: JSON Canonicalization Scheme · RFC Editor
Establishes: A deterministic JSON representation suitable for repeatable hashing and signing through constrained serialization and property ordering.
Boundary: Canonicalization makes equivalent data serialize consistently. It does not provide authentication, secrecy, timestamp authority, or semantic correctness by itself.