Skip to main content

drive/verify/document_having/
mod.rs

1//! Verifies grovedb proofs produced by the having-range
2//! (`GROUP BY … HAVING <aggregate> <op> <value> LIMIT n`) query surface.
3//!
4//! Mirrors the layering of [`super::document_ranked`]: a pure
5//! grovedb-level verifier as a method on
6//! [`DriveDocumentHavingQuery`](crate::query::DriveDocumentHavingQuery)
7//! taking raw `proof: &[u8]` and returning `(RootHash, T)`. The
8//! tenderdash signature composition that wraps this call lives in
9//! `rs-drive-proof-verifier`.
10//!
11//! Only one verifier exists here, for the same reason as on the ranked
12//! surface: every having-range request — any of the three axes, either
13//! direction, any contiguous bound — resolves to one `Bounded` axis
14//! traversal proved through grovedb's unified `prove_query`, against
15//! the same `PathQuery` the verifier reconstructs from the request.
16
17/// Indexed-axis range proof verification — returns the groups the proof
18/// commits to as falling inside the bound, in axis order.
19pub mod verify_having_range_proof;