Status: IN
In-node key lookup uses `bisect_left`/`bisect_right` (binary search), making within-node search O(log B) rather than the textbook O(B) linear scan — shifting the optimal branching factor higher than classical B-tree analysis predicts.
Source: entries/2026/05/29/topic-index-size-vs-scan-cost-benchmarking.md