Forgive my ignorance, as I did read through everything you posted, but i&#x27;m not sure I fully understand how such a system avoids an attack of this form:<p>function check (bits) {
  sleep(bits)
  return false
}<p>Where &#x27;sleep&#x27; may be replaced by some appropriately long-running, arbitrary computation (since presumably these proof programs are not allowed to actually wait). Obviously for input data as complex as a sudoku answer the sleep would be near-infinitely long, but you could surely extract at least several bits of the answer in this way and thereby iteratively extract the whole thing, no?<p>Is there some mitigation for this that i&#x27;m missing?