{"id":"sstable-point-lookup-correct-under-sort-invariant","text":"SSTable point lookups return correct results through two-phase search (binary search on sparse index to identify block, then linear scan within block), with clean None returns for keys not present in the table.","truth_value":"IN","source":"","source_url":"","source_hash":"","justifications":[{"type":"SL","antecedents":["sstable-lookup-is-two-phase","sstable-get-miss-returns-none"],"outlist":["sstable-sorted-order-caller-responsibility"],"label":"Two base beliefs about SSTable read-path correctness form a positive claim gated on the caller's responsibility to maintain sorted key order — violation silently corrupts binary search results with no error, since add() performs no sort validation"}],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"sstable-point-lookup-correct-under-sort-invariant","truth_value":"IN","reason":"SL justification valid","antecedents":["sstable-lookup-is-two-phase","sstable-get-miss-returns-none"],"label":"Two base beliefs about SSTable read-path correctness form a positive claim gated on the caller's responsibility to maintain sorted key order — violation silently corrupts binary search results with no error, since add() performs no sort validation","outlist":["sstable-sorted-order-caller-responsibility"]},{"node":"sstable-lookup-is-two-phase","truth_value":"IN","reason":"premise"},{"node":"sstable-get-miss-returns-none","truth_value":"IN","reason":"premise"}]}}