Recursion Transforms Large Transparent Proofs into Tiny Verifiable Arguments
Proof recursion wraps large, fast STARKs inside small SNARKs, synthesizing transparent, scalable proving with constant-size on-chain verification.
FRIDA Enables Transparent Data Availability Sampling with Poly-Logarithmic Proofs
FRIDA uses a novel FRI-based commitment to achieve non-trusted setup data availability sampling, fundamentally improving scalability.
FRIDA Formalizes Data Availability Sampling with Transparent Cryptographic Proofs
FRIDA introduces the first formal cryptographic primitive for Data Availability Sampling, enabling trustless, scalable block data verification for modular blockchains.
Interactive Oracle Proofs Enable Trustless, Scalable, Post-Quantum Verifiable Computation
Interactive Oracle Proofs generalize PCPs, constructing transparent, quasi-linear proof systems that eliminate trusted setup for mass-scale verifiable computation.
FRIDA: FRI-based Data Availability Sampling without Trusted Setup
Leverages a novel property of the FRI proof system to construct a trustless, efficient data availability sampling scheme for modular blockchains.
PIPFRI: Accelerating Zero-Knowledge Proofs with Novel Polynomial Commitments
A new FRI-based polynomial commitment scheme, PIPFRI, dramatically enhances ZKP prover efficiency, enabling practical, scalable blockchain applications.