P072 Challenge-response timing checks
Can challenge-response timing checks detect precomputed or decoy work as a cheaper alternative to recomputation?
Challenge-response timing checks as a cheaper alternative to recomputation for detecting precomputed or decoy work, against an operator with root and physical access.
Status
Started Four verifier-issued timing probes implemented and run on NVIDIA T4 and H100 GPUs on cloud VMs: proof-of-work, parallel verifiable delay functions, tensor-core GEMM puzzles and a randomly timed VRAM-residency check whose keyed Argon2id pass resists parallel precomputation; solve times separate idle from contended GPUs and HBM-resident from host-resident data (60 GB challenge, more than 350 ms apart). The authors call the probes heuristic indicators, give no false-alarm or miss rates, test no adaptive evader, allow answering on idle identical GPUs, and do not compare cost with recomputation; precomputed or decoy ML work as such is not the tested attack. Cankaya (2025) reports that in his own experiments timing revealed resource contention from hidden parallel work (reported, not published in detail).
the timing gap between the two modes exceeds 350 ms, making them trivial to distinguish.
Raised in: Cankaya (2025), Catching Misreporting About ML Hardware Use by Turning Noise into Signal; Cankaya (2026), A System Overview for Near-Term, Low-Trust AI Compute Verification (v0.2); Dean, Verification Plan (AI 2040).
Sub-questions
| ID | Sub-question | What the sources report |
|---|---|---|
| P072.1 | Does a challenge-response timing protocol detect precomputed or decoy work at a stated detection rate, as an alternative to recomputation, and how much does security-hardening delay erode it? | open |
Possibly relevant work found by automated search
Found by AI agents searching for this problem's sub-questions, mostly by keyword and citation in the OpenAlex scholarly database and on the web; a second AI pass reviewed each one, and we spot-checked some by hand. They seemed reasonably related, as far as one can tell from outside each paper's field. Some come from neighbouring fields, such as arms control and financial audit, and bear on the problem by analogy. Not reviewed against the status above; a paper listed here does not change that status. 928 of 1052 quotes checked word for word against the paper's text.
For P072.1: Does a challenge-response timing protocol detect precomputed or decoy work at a stated detection rate, as an alternative to recomputation, and how much does security-hardening delay erode it?
Data
- problems.csv — one row per problem
- problem_status.csv — status, scope and evidence per problem
- problem_sources.csv — the posed-by quote and other documents per problem
- leaves.csv — all sub-questions, including those without a checkable form
- leaf_sources.csv — every source row behind each sub-question