Verifiable oracle
Proves that real, non-parallelizable time has passed. Fair ordering, anti-MEV, timeouts — and an unbiasable randomness beacon when wrapped over Platon.
Wesolowski VDF over the unfactored RSA-2048 modulus · publicly verifiable, no trust in the oracle
| ID | Price | Output |
|---|---|---|
| chronos.eval@v1 | $0.01 | y = g^(2^T) + proof |
| chronos.verify@v1 | $0.001 | cheap trustless verify |