Linear-Time Polynomial Holographic Interactive Oracle Proofs with Logarithmic-Time Verification for Rank-1 Constraint System from Lookup Protocol
Modern SNARKs are constructed using polynomial Interactive Oracle Proofs (IOPs) and polynomial commitments. In this work, we introduce a novel polynomial holographic IOP for the <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><sema...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-04-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/13/8/1309 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|