That's exacly why I publish my pet projects. To learn from others. You're right. The benchmarks are bad. I benchmarked the best and the worst case in scope of

That's exacly why I publish my pet projects. To learn from others. You're right. The benchmarks are bad. I benchmarked the best and the worst case in scope of the original file, so I look up for the first and the last hash. I totally missed that if I look for the same hash over and over again, I'd end up reading the same B-tree files parts, so they can be easily cached. That's probably the reason it seemed so fast. No lies here, I just missed this (: I'll rewrite benchmarks and update the results.