What happens if you use 2 non-colliding hash functions in a standard merkle tree to get a 32bit merkle root, and then use lookup tables to reverse the possibilities of a given root? 4 billion combinations isn’t too big anymore.
You would need to limit the merkle tree to a known number of leaf nodes, with a known size each.
There would be a small universe of resultants but if you know what you might be looking for, the needle should be easy to find.
Post your sample code somewhere and share, please. Toc Ufp 0.0.0
New contributor
user12497355 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.