No article text was recorded for this version.
proof size optimization
Version 1 of 130 papers46 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Bulletproofs+: Shorter Proofs for Privacy-Enhanced Distributed Ledger
- Blog: BulletCT: Towards More Scalable Ring Confidential Transactions With Transparent Setup
- Blog: SoK: Zero-Knowledge Range Proofs
- Blog: Bulletproofs+: Shorter Proofs for a Privacy-Enhanced Distributed Ledger
- Blog: Zether: Towards Privacy in a Smart Contract World
- Blog: Experimenting with Zero-Knowledge Proofs of Training
- Blog: Balancing Privacy and Accountability in Blockchain Transactions
- Blog: Post-Quantum Zero-Knowledge and Signatures from Symmetric-Key Primitives
- Blog: Fully Dynamic Attribute-Based Signatures for Circuits from Codes
- Blog: Efficient Non-Interactive Zero-Knowledge Proofs in Cross-Domains without Trusted Setup
- Blog: Proving UNSAT in Zero Knowledge
- Blog: Improved Non-Interactive Zero Knowledge with Applications to Post-Quantum Signatures
- Blog: FairZK: A Scalable System to Prove Machine Learning Fairness in Zero-Knowledge
- Blog: DIZK: A Distributed Zero Knowledge Proof System
- Blog: Making Private Function Evaluation Safer, Faster, and Simpler
- Blog: Improved Zero-Knowledge Argument of Encrypted Extended Permutation
- Blog: QuickSilver: Efficient and Affordable Zero-Knowledge Proofs for Circuits and Polynomials over Any Field
- Blog: ZKSMT: A VM for Proving SMT Theorems in Zero Knowledge
- Blog: Guest Editorial: Computing and Combinatorics
- Blog: Committed Vector Oblivious Linear Evaluation and Its Applications
- Blog: zkPi: Proving Lean Theorems in Zero-Knowledge
- Blog: Iterative Oblivious Pseudo-Random Functions and Applications
- Blog: Compressed Sigma Protocols: New Model and Aggregation Techniques
- Blog: TENET : Sublogarithmic Proof, Sublinear Verifier Inner Product Argument without a Trusted Setup
- Blog: Orion: Zero Knowledge Proof with Linear Prover Time
- Blog: HyperPlonk: Plonk with Linear-Time Prover and High-Degree Custom Gates
- Blog: Bivariate Polynomials Modulo Composites and Their Applications
- Blog: Efficient and Post-Quantum Zero-Knowledge Proofs for Blockchain Confidential Transaction Protocols
- Blog: Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors
- Blog: Traceable Policy-Based Signatures and Instantiation from Lattices
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_proof_size_optimization_1cc396be,
title = {proof size optimization},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/proof-size-optimization/rdr_1cc396beafa14ceaa57f713d92658115},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_proof_size_optimization_1cc396be_v1,
title = {proof size optimization},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/proof-size-optimization/rdr_1cc396beafa14ceaa57f713d92658115/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}