{"id":"hash-index-is-memory-bound-by-design","text":"Hash index storage is fundamentally memory-bound: every key must reside in RAM for the single-seek O(1) read path, making dataset size directly constrained by available memory with no spill-to-disk fallback.","truth_value":"IN","source":"","source_url":"","source_hash":"","justifications":[{"type":"SL","antecedents":["hash-index-all-keys-in-memory","hash-index-keys-must-fit-in-ram","hash-index-read-is-single-seek"],"outlist":[],"label":"The O(1) read guarantee is inseparable from the all-keys-in-memory constraint — one cannot exist without the other"}],"dependents":["both-storage-paradigms-hit-scalability-walls"],"metadata":{"last_reviewed":"2026-05-30T09:01:17","review_result":"unnecessary"},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"hash-index-is-memory-bound-by-design","truth_value":"IN","reason":"SL justification valid","antecedents":["hash-index-all-keys-in-memory","hash-index-keys-must-fit-in-ram","hash-index-read-is-single-seek"],"label":"The O(1) read guarantee is inseparable from the all-keys-in-memory constraint — one cannot exist without the other"},{"node":"hash-index-all-keys-in-memory","truth_value":"IN","reason":"premise"},{"node":"hash-index-keys-must-fit-in-ram","truth_value":"IN","reason":"premise"},{"node":"hash-index-read-is-single-seek","truth_value":"IN","reason":"premise"}]}}