Rewindable proofs proposed for scalable oversight without a truthful prover
The honest prover is linear in the original computation, and the verifier is nearly linear in input length after preprocessing.
3 stories, newest first · one card per story
The honest prover is linear in the original computation, and the verifier is nearly linear in input length after preprocessing.
Researchers prove interactive arguments for oracle-aided AI computations cannot, in general, be zero knowledge.
Attack shows unaligned orchestrators can launder capabilities from aligned frontier LLMs via benign subtask consultation, raising Gemma-4-31B CBRN rubric score from 62.3 to 83.1.
Today 1.6K readers · 2.5K views · 778 reads · all time 189K views