Protocol Standard 1.0
Thermodynamic Proof of Absolute Truth
The Rel-Time protocol architecture: Bridging Zero-Knowledge cryptography with the immutable arrow of time via Verifiable Delay Functions and the Bitcoin Timechain.
1. Abstract
In digital systems, time is inherently centralized. System clocks can be spoofed, timestamps can be backdated, and data provenance relies entirely on trusting the entity hosting the database. The Rel-Time protocol introduces a mathematically enforceable, decentralized architecture for temporal data anchoring. By synthesizing hardware-bound Verifiable Delay Functions (VDFs) with the economic finality of the Bitcoin network, Rel-Time provides absolute, unforgeable proof of when a piece of data existed, without ever revealing the data itself.
2. The Mathematics of the T_index
At the core of the Rel-Time protocol is the Temporal Index. This is the moment a client's private data collides with the physical arrow of time.
- Attested_Hash: A zero-knowledge SHA-256 calculation executed strictly on the client's local hardware (optionally combined with their hardware Passkey identity). The raw data never touches a network.
- VDF_Current_Hash: The live output of the Rel-Time Verifiable Delay Function, originally seeded by the latest Bitcoin block hash. Because the VDF runs a continuous, non-parallelizable chain of cryptographic hashes on a single CPU thread, it acts as a physical clock tied to the thermodynamic limits of silicon.
The resulting T_index acts as a cryptographic knot. It is mathematically impossible to generate this specific index without possessing both the exact zero-knowledge file hash and the exact state of the universe's time at that specific millisecond.
3. Merkle Mountain Aggregation & Bifurcated Settlement
To achieve global scale without incurring prohibitive network fees, Rel-Time utilizes a high-frequency memory batcher. Instead of writing every individual T_index to the Bitcoin network—which would be economically unviable—the protocol caches thousands of incoming hashes concurrently.
Every 10 minutes (aligning with Bitcoin's block target), these cached hashes are collapsed into a balanced, symmetric cryptographic Merkle tree. Only the final 32-byte Merkle Root is packaged into an OP_RETURN script and permanently burned into the Bitcoin ledger. This architecture allows Rel-Time to amortize the thermodynamic cost of consensus across thousands of enterprise users instantly.
The Two Settlement Paths
Depending on the client's tier and operational requirements, the protocol intelligently routes the anchor through one of two natively settled paths:
- Path A (Standard Anchor): For Universal clients (Tier 2), the Attested Hash is aggregated directly into the Merkle Tree. This provides mathematically frictionless verification, as end-users only need their original file and passkey to prove existence. The T-Index is provided as an off-chain receipt for local sorting.
- Path B (Temporal Anchor): For Enterprise and Autonomous Agents (Tiers 3 & 4), the T-Index itself is aggregated into the Merkle Tree. This ensures that absolute microsecond ordering is physically locked into the Timechain, providing trustless high-frequency sequence resolution.
4. The Sun-Stamp (Radial Barcode)
To bridge the gap between abstract cryptography and physical utility, the Rel-Time protocol translates the T_index into a machine-readable optical format known as the Sun-Stamp.
The Sun-Stamp is a precise, 64-line polar barcode. Each radial line corresponds to a hexadecimal character of the SHA-256 hash, mapped mathematically to distinct physical lengths. Because the geometry is 100% deterministic, it functions identically to a QR code. A mobile device can scan a Sun-Stamp printed on a shipping container, extract the 64 lengths, reconstruct the hash, and query the open protocol for absolute proof of provenance.
Open Standard Integration
The Rel-Time mathematical standard is open and verifiable. To frictionlessly integrate zero-knowledge time anchoring into your application, you can utilize the lightweight JavaScript SDK.