Expressive and Modular Verifiable Databases (without SNARKs)
Provably introduces a verifiable database infrastructure that enables SQL queries to produce fast, small constant (<5kb) proofs of correctness, completeness, and integrity. Unlike prior approaches relying on specialized circuits or SNARK-heavy constructions, Provably compiles queries directly over tabular data, supporting expressive operations such as joins, aggregates, and snapshots.