No article text was recorded for this version.
linear verification complexity
Version 1 of 19 papers15 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Cougar: Cubic Root Verifier Inner Product Argument under Discrete Logarithm Assumption
- Blog: Bulletproofs+: Shorter Proofs for a Privacy-Enhanced Distributed Ledger
- Blog: ECLIPSE: Enhanced Compiling method for Pedersen-committed zkSNARK Engines
- Blog: Transparent Polynomial Delegation and Its Applications to Zero Knowledge Proof
- Blog: Σ-Check: Compressed Σ-protocol Theory from Sum-check
- Blog: INTERPOL: Information Theoretically Verifiable Polynomial Evaluation
- Blog: Bulletproofs: Short Proofs for Confidential Transactions and More
- Blog: Dualmatrix: conquering zkSNARK for large matrix multiplication
- Blog: Nearly Optimal Verifiable Data Streaming (Full Version)
History & citation
Current · Permanent link
- This direction split from amortized verification cost (78% overlap)
- This direction split from Sublinear Complexity for Succinct Proof Systems (78% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_linear_verification_complexity_728b8af5,
title = {linear verification complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/linear-verification-complexity/rdr_728b8af54c77450c8d2555bb22a2a1a1},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_linear_verification_complexity_728b8af5_v1,
title = {linear verification complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/linear-verification-complexity/rdr_728b8af54c77450c8d2555bb22a2a1a1/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}