A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Fast reductions from RAMs to delegatable succinct constraint satisfaction problems

2013
*
Proceedings of the 4th conference on Innovations in Theoretical Computer Science - ITCS '13
*

Succinct arguments for NP are proof systems that allow a weak verifier to retroactively check computation done by a more powerful prover. These protocols prove membership in languages (consisting of succinctlyrepresented very large constraint satisfaction problems) that, alas, are unnatural in the sense that the problems that arise in practice are not in such form. For general computation tasks, the most natural and efficient representation is typically as random-access machine (RAM)

doi:10.1145/2422436.2422481
dblp:conf/innovations/Ben-SassonCGT13
fatcat:q3dkmogkevhp5j6ljdcxb6iw5m