{"id":"read-cost-scales-with-system-complexity","text":"The read path's correctness burden grows with distribution complexity: single-node reads handle lazy computation and soft-delete interpretation, while distributed reads additionally perform repair, tombstone filtering, and multi-version conflict resolution — the more distributed the system, the more reads pay.","truth_value":"IN","source":"","source_url":"","source_hash":"","justifications":[{"type":"SL","antecedents":["reads-bear-full-correctness-burden","deletion-strategy-scales-with-distribution"],"outlist":[],"label":"deletion strategy scaling from soft-delete to tombstones directly increases what the read path must interpret and reconcile"}],"dependents":["complexity-increases-both-read-cost-and-read-risk","cost-model-adapts-to-access-frequency","growing-read-complexity-outpaces-test-coverage"],"metadata":{"last_reviewed":"2026-06-05T18:21:49","review_result":"pass"},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"read-cost-scales-with-system-complexity","truth_value":"IN","reason":"SL justification valid","antecedents":["reads-bear-full-correctness-burden","deletion-strategy-scales-with-distribution"],"label":"deletion strategy scaling from soft-delete to tombstones directly increases what the read path must interpret and reconcile"},{"node":"reads-bear-full-correctness-burden","truth_value":"IN","reason":"SL justification valid","antecedents":["read-path-absorbs-consistency-and-computation-cost","deletion-is-metadata-in-replicated-systems"],"label":"Both depth-2 conclusions shift complexity to reads — one for computation/convergence, the other for deletion semantics — together establishing reads as the locus of correctness"},{"node":"read-path-absorbs-consistency-and-computation-cost","truth_value":"IN","reason":"SL justification valid","antecedents":["lazy-read-time-evaluation-trades-write-simplicity-for-read-cost","kv-read-path-is-self-healing"],"label":"lazy eval (autocomplete decay, URL expiration, payment balance) defers computation to reads; KV read repair defers convergence to reads — the combined pattern reveals a systematic bias toward read-path complexity across the repo"},{"node":"lazy-read-time-evaluation-trades-write-simplicity-for-read-cost","truth_value":"IN","reason":"SL justification valid","antecedents":["autocomplete-decay-is-read-time","url-shortener-expiration-lazy","payment-balance-never-cached"],"label":"Three independent systems chose lazy evaluation, suggesting write-simplicity is the dominant concern in pedagogical implementations"},{"node":"autocomplete-decay-is-read-time","truth_value":"IN","reason":"premise"},{"node":"url-shortener-expiration-lazy","truth_value":"IN","reason":"premise"},{"node":"payment-balance-never-cached","truth_value":"IN","reason":"premise"},{"node":"kv-read-path-is-self-healing","truth_value":"IN","reason":"SL justification valid","antecedents":["kv-read-repair-on-get","kv-node-stores-sibling-versions"],"label":"Read repair + sibling detection make the read path an active consistency mechanism, not just a query"},{"node":"kv-read-repair-on-get","truth_value":"IN","reason":"premise"},{"node":"kv-node-stores-sibling-versions","truth_value":"IN","reason":"premise"},{"node":"deletion-is-metadata-in-replicated-systems","truth_value":"IN","reason":"SL justification valid","antecedents":["soft-delete-prevents-distributed-resurrection","append-only-versioning-makes-restore-non-destructive"],"label":"both depth-1 conclusions independently arrive at the same principle — never physically destroy data — but for complementary reasons (anti-resurrection vs non-destructive restore); combined they show this is a fundamental constraint of any system that replicates or versions state"},{"node":"soft-delete-prevents-distributed-resurrection","truth_value":"IN","reason":"SL justification valid","antecedents":["kv-store-deletes-use-tombstones","s3-delete-marker-hides-not-removes"],"label":"Both systems independently arrived at write-over-delete to prevent resurrection from unsynchronized replicas"},{"node":"kv-store-deletes-use-tombstones","truth_value":"IN","reason":"premise"},{"node":"s3-delete-marker-hides-not-removes","truth_value":"IN","reason":"premise"},{"node":"append-only-versioning-makes-restore-non-destructive","truth_value":"IN","reason":"SL justification valid","antecedents":["s3-version-list-append-only","gdrive-restore-creates-new-version"],"label":"Append-only version lists make restore a forward operation, not a rollback"},{"node":"s3-version-list-append-only","truth_value":"IN","reason":"premise"},{"node":"gdrive-restore-creates-new-version","truth_value":"IN","reason":"premise"},{"node":"deletion-strategy-scales-with-distribution","truth_value":"IN","reason":"SL justification valid","antecedents":["soft-delete-is-dual-purpose","kv-anti-entropy-covers-writes-and-deletes"],"label":"Soft delete for structure preservation and tombstones for distributed convergence are complementary layers that compose"},{"node":"soft-delete-is-dual-purpose","truth_value":"IN","reason":"SL justification valid","antecedents":["soft-delete-preserves-structural-invariants","soft-delete-prevents-distributed-resurrection"],"label":"Both depth-1 soft-delete conclusions identify different motivations (structural invariants vs. resurrection prevention) for the same technique, revealing dual utility"},{"node":"soft-delete-preserves-structural-invariants","truth_value":"IN","reason":"SL justification valid","antecedents":["chat-soft-delete-preserves-sequence","autocomplete-delete-is-soft"],"label":"chat keeps deleted messages with `[deleted]` content to preserve sequence numbering; autocomplete zeroes frequency without removing trie nodes to preserve tree structure — both are single-node structural concerns distinct from distributed anti-resurrection"},{"node":"chat-soft-delete-preserves-sequence","truth_value":"IN","reason":"premise"},{"node":"autocomplete-delete-is-soft","truth_value":"IN","reason":"premise"},{"node":"kv-anti-entropy-covers-writes-and-deletes","truth_value":"IN","reason":"SL justification valid","antecedents":["kv-read-path-is-self-healing","soft-delete-prevents-distributed-resurrection"],"label":"without read repair, write divergence persists; without tombstones, deletes get resurrected — both mechanisms are independently necessary for full convergence"}]}}