Featured
Polynomial Commitment Schemes: FRI and KZG for Fast & Succinct Zero-Knowledge Proofs
Research
Zero-knowledge proof systems today often face a trade-off between speed and succinctness. STARK-based systems offer fast proving without a trusted setup, but their proofs are large. SNARK-based systems, on the other hand, produce tiny proofs that verify quickly, at the cost of a trusted setup or heavier cryptography.
All Posts
Polynomial Commitment Schemes: FRI and KZG for Fast & Succinct Zero-Knowledge Proofs
Research
March 12, 2026
What Is Plonk...And Why?
Research
March 12, 2026
Inside ZK Systems: From Interactive Proofs to SNARKs
Research
March 5, 2026
Transaction Ordering in On-Chain Perpetual Markets
Research
February 12, 2026
Introducing Parasol: The Engine Making Solana the Onchain Perps Machine
Announcements
February 12, 2026