Toward improved non-interactive proof systems

Abstract

The study of non-interactive proof systems, such as Merlin-Arthur proof systems and probabilistically checkable proofs, can yield insights into problems for which we do not yet have efficient algorithms. This work compiles many recent results in improved non-interactive proof systems–primarily Merlin-Arthur protocols for problems studied in the field of fine-grained complexity–and proposes a construction for interesting Merlin-Arthur protocols for any problem from an efficiently constructable PCP for the same.