{"id":"btree-leaf-sibling-chain","text":"Leaves store a `next_sibling` pointer forming a left-to-right chain terminated by `NO_SIBLING` (0xFFFFFFFF), enabling range scans without touching internal nodes.","truth_value":"IN","source":"entries/2026/05/28/b-tree-storage-engine-btree.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"explanation":{"steps":[{"node":"btree-leaf-sibling-chain","truth_value":"IN","reason":"premise"}]}}