General composition schemes for probabilistically checkable reconfiguration proofs (PCRPs)

Develop a general composition scheme for probabilistically checkable reconfiguration proofs that enables composing inner and outer verifiers in the reconfiguration setting, analogous to composition in PCPs of proximity.

Background

The paper composes assignment testers with circuit-based instances to implement alphabet reduction while preserving perfect completeness in reconfiguration, and it connects the construction to PCRPs.

The authors explicitly ask whether there exists a general composition framework for PCRPs, which would systematize and potentially extend their composition method.