Author: Miodrag J. Mateljević & Zoran Merkle Year: ~2019 (Often cited as Merle 19 or similar in optimization contexts) Title: Jonker-Volgenant Algorithm for Linear Assignment Problem Topic: Mathematical analysis of algorithms used for the Linear Assignment Problem (LAP). How to find it: Search for "Miodrag Mateljevic Zoran Merkle Jonker-Volgenant".
If only ( m ) out of ( n ) possible leaves are filled, a sparse Merkle tree stores only non-empty subtrees. Mathematical representation uses binary tries of depth ( k ) with empty markers.
Proof size = ( O(\log n) ) still holds, but path pruning reduces storage.
Merkle trees, introduced by Ralph Merkle in 1979, represent one of the most elegant applications of hash functions in computer science. This article presents a rigorous mathematical analysis of Merkle trees, focusing on their combinatorial structure, complexity bounds, probabilistic security arguments, and optimality properties. We derive closed-form expressions for proof sizes, analyze the probability of undetected tampering, and demonstrate why binary Merkle trees achieve top (optimal) asymptotic performance. This treatment corresponds to a top-tier (19pdf) technical monograph level. matematicka analiza merkle 19pdf top
Merkle trees assume a static data set or require rebuilding on updates. For dynamic data, Merkle hash trees can be extended to authenticated dictionaries with ( O(\log n) ) update and proof costs, but this requires balancing (e.g., using Merkle AVL trees). The mathematical trade-off is between update flexibility and proof optimality — no structure can achieve ( o(\log n) ) for both without relaxing security assumptions.
In Ethereum, the Merkle Patricia Tree combines a Merkle tree with a radix trie (prefix tree). Mathematical modifications:
Binary Merkle trees remain the standard for Bitcoin’s Simple Payment Verification (SPV). Author: Miodrag J
Consider an adversary trying to produce a fake Merkle proof. The success probability after ( t ) attempts is bounded by ( t \cdot 2^-h ) where ( h ) is output bits. This linear bound in ( t ) is a discrete analog of Lipschitz continuity in the space of proofs — a concept from functional analysis.
Theorem 5 (Lower bound):
Any authentication scheme for ( n ) independent data blocks that allows verification of a single block with less than ( \log_2 n ) transmitted cryptographic digests is insecure against a computationally unbounded adversary, assuming no pre-verifier state beyond root.
Proof: Without ( \log_2 n ) independent digests, the adversary can simulate missing branches with arbitrary hashes and find collisions. This is a combinatorial argument based on the pigeonhole principle on hash chains. Merkle trees assume a static data set or
Merkle trees match this bound exactly (within 1 hash).
Probability a random forgery succeeds: Without access to preimages, the adversary must guess a sibling hash that recomputes to ( R ). This is as hard as finding a second preimage for ( H ).
If output length ( m = 256 ) bits (SHA-256), brute force probability per attempt = ( 2^-256 ).