🌱 Notes on scaling nullifier sets
tl;dr: Trying to organize some thoughts on how to scale nullifier sets.
🌱 Polynomial Interactive Oracle Proofs (PIOPs)
tl;dr: PIOPs, as originally introduced in the DARK paper[^BFS20].
(Although I think they were kind of already defined in PLONK[^GWC19] and Marlin[^CHMplus19e]?)
🌱 Interactive Oracle Proofs of Proximity (IOPP)
tl;dr: A relaxation of IOPs that is central to hash-based proof systems like FRI, STIR[^ACFY24eSTIR] and WHIR.
🌱 Interactive Oracle Proofs (IOPs)
tl;dr: An interactive oracle proof (IOP) is an interactive proof system where the verifier has oracle access to the prover’s messages rather than reading them in full. This combines the expressiveness of interactive proofs with the efficiency of PCPs. Introduced in [BCS16][^BCS16].
🌱 Error-correcting codes
tl;dr: Too many FRI[^BBHR18FRI] conjectures that need to be understood, so here we are…
🌲 Pedersen commitments
tl;dr: Pedersen commitments[^Pede91Comm] are one of the most important cryptographic primitives for a beginner to understand, in my opinion.
110 post articles, 14 pages.