Verifying decentralized compute workloads without disclosing private execution states requires ultra-efficient succinct arguments. Poly-Proof implements recursive folding schemes that compress hundreds of thousands of arithmetic gates into a 48-byte proof without trusted setup assumptions.
A folding-scheme zero-knowledge verification engine that validates complex off-chain cloud compute runs in sub-millisecond execution cycles.
Nova folding schemes, multivariate sum-check protocols, elliptic curve cycle pairings.
Sub-40 millisecond proof generation for 65,536 R1CS constraints on consumer silicon.
48-byte constant-size recursive proof verified in 1.8 milliseconds on standard runtimes.
Zero trusted setup ceremony required; publicly auditable mathematical guarantees.
Heterogeneous Compute Benchmark (AMD Threadripper & Apple M3 Max)
@techreport{georbit_recursive_zk_prover,
title = {Poly-Proof: Sub-Second Recursive Polynomial Verifier},
author = {Ayaan Saifi},
institution = {Georbit Research Wing of Orbit},
year = {2024},
url = {https://georbit.org/projects/recursive-zk-prover}
}