BaseFold: Efficient Field-Agnostic Polynomial Commitment Schemes from Foldable Codes

ePrint Report: BaseFold: Efficient Field-Agnostic Polynomial Commitment Schemes from Foldable Codes

Hadas Zeilberger, Binyi Chen, Ben Fisch

Interactive Oracle Proof of Proximity (IOPPs) are a powerful tool for constructing succinct non-interactive arguments of knowledge (SNARKs) in the random oracle model, which are fast and plausibly post-quantum secure. The Fast Reed Solomon IOPP (FRI) is the most widely used in practice, while tensor-code IOPPs (such as Brakedown) achieve significantly faster prover times at the cost of much larger proofs. IOPPs are …

ben ben fisch chen eprint report fast knowledge non oracle post-quantum proof proximity quantum quantum secure random report tool