{"id":"brute-force-acceptable-at-pedagogical-scale","text":"Four systems use algorithmically sub-optimal implementations — linear prefix scan, key-by-key Merkle diff, full re-sort on insertion, linear purge on unfollow — where O(log n) alternatives exist, prioritizing implementation clarity over asymptotic efficiency at the pedagogical scale these modules target.","truth_value":"IN","source":"","source_url":"","source_hash":"","justifications":[{"type":"SL","antecedents":["geohash-nearby-prefix-scan-is-linear","kv-merkle-tree-brute-force-diff","stock-exchange-price-sort-is-full-resort","news-feed-unfollow-purges-via-linear-scan"],"outlist":[],"label":"Consistent choice of simple O(n) over optimal O(log n) across unrelated modules indicates a deliberate pedagogical convention"}],"dependents":["algorithmic-simplicity-is-preferred-over-optimal-performance","pedagogical-tradeoffs-are-safe-within-module-boundaries"],"metadata":{"last_reviewed":"2026-06-06T06:26:57","review_result":"pass"},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"brute-force-acceptable-at-pedagogical-scale","truth_value":"IN","reason":"SL justification valid","antecedents":["geohash-nearby-prefix-scan-is-linear","kv-merkle-tree-brute-force-diff","stock-exchange-price-sort-is-full-resort","news-feed-unfollow-purges-via-linear-scan"],"label":"Consistent choice of simple O(n) over optimal O(log n) across unrelated modules indicates a deliberate pedagogical convention"},{"node":"geohash-nearby-prefix-scan-is-linear","truth_value":"IN","reason":"premise"},{"node":"kv-merkle-tree-brute-force-diff","truth_value":"IN","reason":"premise"},{"node":"stock-exchange-price-sort-is-full-resort","truth_value":"IN","reason":"premise"},{"node":"news-feed-unfollow-purges-via-linear-scan","truth_value":"IN","reason":"premise"}]}}