Fresh-Challenge VDF Attestations for Model-Relative Response Latency
Fresh-Challenge VDF Attestations bind verifiable delay functions to unpredictable public challenges, yielding succinct evidence of model-relative response latency.
The paper specifies FCLA, a protocol composition that binds a VDF to an unpredictable public challenge, a message, and independently auditable release/receipt records. Under explicit assumptions about VDF sequentiality and a calibrated bound on an adversary's sequential evaluation rate, an accepted transcript is inconsistent with post-challenge generation. A benchmark of the public reference implementation confirms the expected evaluation-versus-verification separation on one documented machine. The contribution is a protocol design analysis, not a new VDF construction.
- FCLA binds VDF proofs to fresh public challenges to prevent precomputation
- Accepted transcripts contradict post-challenge generation under bounded sequential-rate assumptions
- Protocol cannot exclude relaying, outsourcing, or a faster unmodeled machine
- Benchmark of reference implementation confirms evaluation-verification cost separation
From the original article
1 min read at arxiv.orgCan a finite verifier obtain public, model-relative evidence about response latency for sequential computation? Verifiable delay functions (VDFs) make this possible in principle: evaluation requires T sequential steps, whereas verification is efficient in the security parameter and polylogarithmic in the numerical value of T for standard constructions.
By Ansar Yesmukhanov · arxiv.org
A short excerpt; the article and its images belong to the publisher. Summary, key facts and assessment above are AI-written from the article and can be wrong.