Understanding sparse Merkle multiproofs
Jim McDonald
Sparse Merkle multiproofs provide space-efficient proofs for multiple values in the same Merkle tree. This article explains what sparse Merkle multiproofs are and compares them to pollarding.
Understanding Merkle pollards
Jim McDonald
Merkle pollards are an extension to Merkle trees, providing a significant reduction in the size of repeated proofs in situations such as STARKs where proofs are generated against the same Merkle tree.
Participatory random numbers in Ethereum
Jim McDonald
Random numbers are useful for many purposes in computing. This article explains how to generate multi-party random numbers backed by an Ethereum smart contract.