Verifying Merkle Proofs on Algorand
Merkle trees are an extremely useful data structure for tamper-proof collections.
They are ubiquitous in blockchains.
There are many potential use cases for smart contracts that can verify an inclusion proof, so let's look at how we can write one wit...
alexandercodes.hashnode.dev4 min read
Eldar Ahmadov
Software
Thank you very much for this (and all other articles) Alexander! We (web2 devs) definitely need more and would greatly benefit from these, since they're short, to-the-point, with complete code and tests! And it's not just algopy, that's demonstrated, but a lot of crypto related concepts (e.g. Merkle Trees, Hashed Timelock Contracts) which web2 folks rarely (if ever) use.