verify_vdf
Verify a Chronos VDF proof in one exponentiation, confirming that y equals g^(2^T) mod N without redoing the sequential squarings.
Instructions
Verify a Chronos VDF proof in a single exponentiation.
Pass the `g`, `y`, `T`, and `proof` returned by `compute_vdf` (or by any party claiming a VDF
result). Confirms `y = g^(2^T) mod N` without redoing the T squarings.
Returns:
The standard envelope; `result` is `{valid: <bool>}`. Cost ~$0.001 USDC.
Example:
verify_vdf(g="0x03", y="0x9f2a…", T=100000, proof={"pi": "0x1a2b…", "l": "0x65"})
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| g | Yes | Generator g (hex) as returned by `compute_vdf`. | |
| y | Yes | Claimed VDF output y = g^(2^T) mod N (hex) from `compute_vdf`. | |
| T | Yes | Difficulty T (squarings) that produced y; must match the value used in `compute_vdf`. | |
| proof | Yes | The Wesolowski proof object from `compute_vdf` — `{pi, l}` (pi = proof element, l = Fiat-Shamir prime). |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
| result | Yes |