In the context of interactive proofs, a "folding scheme" (popularized by Nova) is a way to combine multiple instances of a constraint system into a single instance, so the validity of the multiple instances can statistically be reduced to the validity of a single one. We show how Nova folding can be generalized to ``custom'' gates and extra rounds of verifier randomness. As an application of this extension, we present Origami, the first (to our knowledge) known example of a folding scheme for lookups.

翻译：在交互式证明的语境中，“折叠方案”是一种将约束系统的多个实例合并为单个实例的方法（由Nova推广），从而使得多个实例的有效性可统计地约简为单个实例的有效性。我们展示了如何将Nova折叠方案推广到“自定义”门电路以及额外轮次的验证者随机性。作为该扩展的应用，我们提出了Origami——据我们所知，这是首个已知的针对查找操作的折叠方案实例。