Ceramist
A Coq library for formally verifying probabilistic properties of hash-based approximate membership query structures like Bloom filters.
What is Ceramist?
Ceramist is a Coq library for formally verifying hash-based approximate membership query (AMQ) structures. It provides a framework to mathematically prove probabilistic properties of data structures like Bloom filters, counting Bloom filters, and quotient filters, ensuring their correctness and reliability in space-efficient applications.
Researchers and developers working on formally verified systems, probabilistic algorithms, or data structures who need rigorous guarantees for AMQ implementations, particularly in fields like distributed systems, databases, and networking.
Ceramist offers machine-checked proofs for probabilistic data structures, reducing the risk of subtle bugs in AMQ implementations. Its modular design and specialized proof tactics make formal verification more accessible and systematic compared to manual proofs or testing alone.
Overview
Verified hash-based AMQ structures in Coq
Use Cases
Best For
- Verifying correctness of Bloom filter implementations
Related Projects
Found a gem we're missing?
Open-Awesome is built by the community, for the community. Submit a project, suggest an awesome list, or help improve the catalog on GitHub.
