Status: IN
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).
Source: entries/2026/05/29/topic-merkle-proof-security-model.md
JSON