{"id":"merkle-proof-size-is-log-n","text":"A Merkle proof contains exactly `height` sibling hashes where height = log2(next_power_of_2(leaf_count)), making both proof size and verification cost O(log N).","truth_value":"IN","source":"entries/2026/05/29/topic-merkle-proof-security-model.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"explanation":{"steps":[{"node":"merkle-proof-size-is-log-n","truth_value":"IN","reason":"premise"}]}}