brakedown-pcs.md

brakedown PCS — Merkle-free polynomial commitment replace WHIR's Reed-Solomon + Merkle tree commitment with linear-time encodable codes using expander graphs. eliminates Merkle auth paths entirely — the 77% of proof size and 83% of recursive verifier cost. goes beyond proof-horizons Horizon 1…