Expand description
The two ranked executors on DriveDocumentRankedQuery: a direct
read of the axis secondary, and generation of the equivalent proof.
Both are thin — all of the work happens inside grovedb, which walks
the pre-sorted secondary Merk directly. That is the whole point of the
ranked surface: no value trees are opened, no documents are
materialized, and the cost is O(log n + k) rather than
O(groups × log n).
Whole module is gated feature = "server" via the parent’s
pub mod execute_top_k; declaration.