Hash-based
These are the most conservative PQ assumption (no structured algebraic problem, only hash security). All are transparent (no trusted setup). The PQ property comes entirely from the polynomial commitment scheme (PCS), which here is code/hash based.
FRI-based (Reed-Solomon IOP + Merkle/hash):
- STARK (Ben-Sasson et al., 2018) - the canonical one. It uses hash functions as the only cryptographic assumption and offers the absence of a trusted setup and the resistance to quantum attacks, since no use is made of the discrete logarithm problem and elliptic curves.
- Aurora (Ben-Sasson et al., 2019) - RS-IOP for R1CS, polylog proof but linear verifier.
- Virgo (Zhang et al., 2020) - GKR + FRI-based PCS.
- Plonky2 - PLONK arithmetization + FRI over Goldilocks (64-bit), fast recursion.
- Plonky3 (no paper) - modular successor. Plonky3 contains 5 finite fields: one large field BN254 (not post-quantum), one 64 bit field Goldilocks, and three 31 bit fields BabyBear, KoalaBear and Mersenne31; the 31-bit fields are the optimized path. Except BN254 these instantiations are post-quantum.
- Circle-STARK prover over Mersenne31. StarkWare is preparing to implement the research in a new prover, called Stwo.
Improved FRI variants / next-gen low-degree tests (drop-in PCS replacements that keep the same PQ assumption):
- DEEP-FRI, STIR, and WHIR - successive improvements to the FRI proximity test reducing query/proof costs. WHIR is the current state of the art for hash-based PCS.
Linear-code-based (Merkle-committed, not RS/FRI), "Brakedown family":
- Ligero (Ames et al., 2017) - square-root proofs.
- Ligero++ - adds polylog proof size and zero-knowledge.
- Brakedown (Golovnev et al., 2023) - linear-time, field-agnostic prover for R1CS.
- Orion (Xie et al., 2022) - linear-time prover, polylog proofs via recursive code-based SNARK. Note a soundness caveat: Orion was discovered to be unsound, which was then repaired through the use of a commit-and-prove SNARK as an "outer" SNARK, and a 2024 paper argues the repaired version still has issues, so check the latest revision before adopting.
- Expand-Accumulate Code SNARKs (2024) and Blaze (interleaved RAA codes, Eurocrypt 2025) - newer field-agnostic linear-code constructions.
a16z's summary on this whole family: schemes that are both transparent and plausibly post-quantum include FRI, Ligero, Ligero++, Brakedown, and Orion. All of these schemes are based on error-correcting codes. Hashing is the only cryptographic primitive they use. a16z crypto
Binary-tower-field systems:
- Binius - operates over GF(2) towers. The entire value proposition of Binius lies in its ability to use the smallest power-of-two field size for witnesses. Tradeoff: its relatively large proof size, which scales with the square root of the witness size.