Trusted Time • Randomness • Integrity

A new foundation for trusted time.

Zurvan commercializes Stamp/Beacon Trees, a new cryptographic primitive that combines precise timestamping, secure time synchronization, and an unbiased random beacon into one verifiable service.

Designed for governments, telcos, banks, and AI data centres that can’t afford to guess about “when” things happened.

1 · Timestamping

High-precision, attested timestamps

Each leaf commits to a digest, nonce, and precise receive/publish deltas relative to an absolute time T with error bound ε — not just “somewhere in this second”.

2 · Random beacon

Unbiased randomness with timing guarantees

Nonces are guaranteed secret until their publish window, turning each leaf into a verifiable random beacon suitable for lotteries, protocols, and fair draws.

3 · Time sync

Secure NTP replacement

The protocol supports NTP-style four-timestamp measurements with explicit attacker and latency modelling, providing secure clock synchronization under MITM.

Who is Zurvan for?

Any system where time, ordering, and randomness have real money, real safety, or real legal consequences.

Governments & regulators: tamper-evident logs, digital forensics, and national time infrastructure.
Telecom & 5G/6G: secure base station synchronization and timing for ultra-low-latency networks.
Finance & exchanges: provable ordering of trades and compliance-grade timestamps.
AI & data centres: verifiable time across distributed GPU clusters and multi-region jobs.
Lotteries, gaming, consensus protocols: unbiased randomness with clear publication windows.

4–6× cheaper

Modelled 5-year TCO vs Guardtime/KSI for a Canada-scale deployment.

100k+ tps

National-scale timestamping and beacon service, limited by network, not a central core.

One protocol

Timestamping, secure time sync, and randomness — unified under Stamp/Beacon Trees.

Zero tokens

No speculation, no pre-mine, no governance token. Just infrastructure.

How Zurvan runs Stamp/Beacon Trees

A simple trust model: a small cluster of audited notaries, and a large fleet of untrusted aggregators. All proofs are publicly verifiable.

Clients submit digests to Zurvan gateways or directly to the aggregation layer.
Aggregators build Merkle trees over incoming digests; they hold no secrets and can run anywhere.
Notaries stamp tree roots with absolute time T, uncertainty ε, and per-leaf (d, n, s, p) semantics.
Clients receive compact proofs that can be verified offline, in court, or in other systems.

                            { /* pseudocode illustration only */ }
                            leaf_i = H(
                            "STAMPBEACON_LEAF" ||
                            d_i || n_i ||
                            encode(s_i) || encode(p_i)
                            )

                            notary_signature = Sign(
                            root_merkle,
                            T,
                            epsilon
                            )
                        

Zurvan implements this construction as a managed service, with audited notary clusters and horizontally scalable aggregators.

Talk to us about a pilot deployment

If you're responsible for critical infrastructure, national security, financial markets, or telecom networks, we should talk. Zurvan is assembling a small group of early partners to shape the production network.