compute_vdf
Evaluate a Verifiable Delay Function to produce provable proof of elapsed sequential work, ensuring fair ordering, timed reveals, and unpredictable randomness.
Instructions
Evaluate a Verifiable Delay Function (Chronos) — proof that real sequential work elapsed.
Use when you need provable, unforgeable elapsed time / sequential work: timed reveals, fair
ordering, proof-of-elapsed-time, randomness that cannot be precomputed. Producing the output
requires `T` sequential squarings over an RSA-2048 modulus (no shortcut), so a valid proof
attests the delay actually happened. Verify cheaply with `verify_vdf`.
Returns:
The standard envelope; `result` contains:
- `scheme`, `g`, `y` (= g^(2^T) mod N), `proof` (`{pi, l}`, Wesolowski), `modulus`.
`verifiable.has_proof` will be true. Cost ~$0.01 USDC.
Example:
compute_vdf(seed="0x1234abcd", difficulty=100000)
Input Schema
TableJSON Schema
| Name | Required | Description | Default |
|---|---|---|---|
| seed | Yes | Seed (hex) the VDF is evaluated over; it binds the generator g, so the output is tied to this input. | |
| difficulty | No | T — the number of sequential squarings to perform (1..1_000_000). Higher T = more wall-clock work that cannot be parallelized/GPU-accelerated, i.e. a longer provable delay. ~1000 is a fast demo; tune T to the delay you need. |
Output Schema
TableJSON Schema
| Name | Required | Description | Default |
|---|---|---|---|
| result | Yes |