Modular Framework Composes Verifiable Proofs, Scaling Sequential Computation Integrity
A new Verifiable Evaluation Scheme enables composable proof pipelines, drastically reducing overhead for complex, sequential computations like ZK-ML.
Expander Signatures Decouple Signature Generation Cost from Verification Complexity
This novel cryptographic primitive allows a powerful signer to generate all future signatures simultaneously, enabling constant-size verification on resource-limited devices.
Sublinear Memory Zero-Knowledge Proofs Democratize Verifiable Computation Access
A space-efficient tree algorithm reduces ZKP prover memory from linear to square-root complexity, enabling verifiable computation on mobile and edge devices.
