Linear-Time Field-Agnostic SNARKs Unlock Massively Scalable Verifiable Computation
Brakedown introduces a practical linear-time encodable code, enabling the first $O(N)$ SNARK prover, fundamentally scaling verifiable computation and ZK-Rollups.
