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):

Improved FRI variants / next-gen low-degree tests (drop-in PCS replacements that keep the same PQ assumption):

Linear-code-based (Merkle-committed, not RS/FRI), "Brakedown family":

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: