The research behind Provably
We’re building the scientific foundation for verifiable data in distributed systems, so AI agents and workflows can trust the data they act on.
Accepted into CCS 2026
QEDB: Expressive and Modular Verifiable Databases
Every query comes back with a proof that the answer is correct, so your database can run on infrastructure you don’t control.
Read paper
- Page 5
Proof size
About a kilobyte on most queries, whatever the number of rows. Every other scheme of its kind grows with the database.
- Page 13
Standard assumptions
Built from accumulators and vector commitments rather than general-purpose proof systems, so there are no circuits to write and no heuristic assumptions to rest on.
- Page 14
Verification
Aggregation and selection queries check out in milliseconds, and the Rust implementation scales to databases of millions of rows.