Notes Show All32 Aptos2 Aptos Keyless1 Bulletproofs1 ElGamal2 FRI2 Fiat-Shamir1 Groth161 LLM1 Merkle5 Move1 PVSS1 Shor1 accumulators1 anonymous payments2 basics1 benchmarks6 coding theory4 digital signatures1 distributed key generation (DKG)1 domain-separation1 elliptic curves2 encryption2 inner-product arguments (IPAs)3 math2 multilinear extensions (MLEs)2 nullifier1 number theory1 papers1 polynomial commitments4 polynomials1 post-quantum3 range proofs2 rank-1 constraint systems (R1CS)1 sigma protocols4 vector commitments (VCs)1 verifiable shuffle1 witness encryption (WE)1 zero-knowledge proofs (ZKPs)9 2026 Apr 15Groth21 PVSS Apr 14Aptos Move Apr 05TIL: Malleable algebraic NIZKs Apr 04Witness encryption (WE) Apr 03Quantum computing Mar 25Multilinear polynomial commitment schemes (MLE PCS) Mar 22Large language models (LLMs) Mar 21Untraceable transactions (UTT) Mar 20Fiat-Shamir transform Mar 17Inner-product arguments (IPAs) Feb 04TIL: Field multiplications are faster than hashing! 2025 Dec 18Goldwasser-Kalai-Rothblum (GKR) proofs Dec 08Post-quantum signature schemes Dec 02Curve trees Nov 19Domain separation Nov 13$\Sigma$-phore Nov 12Notes on scaling nullifier sets Nov 06Error-correcting codes Nov 06Interactive Oracle Proofs (IOPs) Nov 06Interactive Oracle Proofs of Proximity (IOPP) Nov 06Ligerito Nov 06Polynomial Interactive Oracle Proofs (PIOPs) Nov 06WHIR Oct 29Zero-knowledge proofs for Aptos Keyless Sep 15Fast Reed-Solomon Interactive Oracle Proofs of Proximity (FRI) Aug 08Confidential assets on Aptos Jun 20Marlin Jun 06Bayer-Groth verifiable shuffle 2024 Sep 02Bulletproofs IPA for multiexp Jul 21Elliptic curves 2022 Nov 18Hyperproofs: Faster Merkle proof aggregation without SNARKs 2021 Apr 15Basic number theory