{"id":"perimeter-defense-enables-cheap-writes","text":"The write path's cheapness is partially enabled by the perimeter defense model: because inputs are normalized once at system boundaries and internal callers are trusted, writes operate on pre-validated data without redundant checking, keeping the asymmetric cost model's write side genuinely lightweight beyond just routing simplicity.","truth_value":"IN","source":"","source_url":"","source_hash":"","justifications":[{"type":"SL","antecedents":["perimeter-defense-ensures-data-quality","writes-are-cheap-reads-pay"],"outlist":[],"label":"perimeter defense and asymmetric cost allocation are independently motivated but mutually reinforcing — the trust model explains HOW writes stay cheap, not just THAT they are cheap"}],"dependents":["write-path-is-cheap-correct-and-coordination-free"],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"perimeter-defense-enables-cheap-writes","truth_value":"IN","reason":"SL justification valid","antecedents":["perimeter-defense-ensures-data-quality","writes-are-cheap-reads-pay"],"label":"perimeter defense and asymmetric cost allocation are independently motivated but mutually reinforcing — the trust model explains HOW writes stay cheap, not just THAT they are cheap"},{"node":"writes-are-cheap-reads-pay","truth_value":"IN","reason":"SL justification valid","antecedents":["write-time-decisions-are-lightweight-but-binding","read-path-absorbs-consistency-and-computation-cost"],"label":"Write-side minimalism and read-side cost absorption are two faces of the same design tradeoff, consistently applied across KV, chat, news feed, autocomplete, and payment"},{"node":"write-time-decisions-are-lightweight-but-binding","truth_value":"IN","reason":"SL justification valid","antecedents":["fan-out-write-pushes-references-not-data","write-time-routing-is-irrevocable"],"label":"Fan-out pushes references (lightweight) and routing decisions are permanent (binding) — the write path optimizes for speed at the cost of flexibility"},{"node":"fan-out-write-pushes-references-not-data","truth_value":"IN","reason":"SL justification valid","antecedents":["chat-fanout-on-write","news-feed-fan-out-write-pushes-ids"],"label":"Reference-based fanout limits write amplification to pointer-sized payloads"},{"node":"chat-fanout-on-write","truth_value":"IN","reason":"premise"},{"node":"news-feed-fan-out-write-pushes-ids","truth_value":"IN","reason":"premise"},{"node":"write-time-routing-is-irrevocable","truth_value":"IN","reason":"SL justification valid","antecedents":["news-feed-celebrity-threshold-at-write-time","chat-fanout-on-write"],"label":"news feed selects fan-out-on-write vs fan-out-on-read based on follower count at publish time; chat routes to inbox or offline queue based on presence at send time — both decisions are baked in at write time and not revisited"},{"node":"news-feed-celebrity-threshold-at-write-time","truth_value":"IN","reason":"premise"},{"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"}]}}