Hash Functions

An introduction to Bloom filters, a probabilistic data structure for efficient membership testing. Learn how they work, their properties, mathematical analysis, and their significant application in Bitcoin for enhancing the privacy and efficiency of light (SPV) nodes.

Explore Merkle trees (binary hash trees): their construction, use of cryptographic hash functions, and role in data integrity. Learn about applications in Bitcoin, SPV nodes, vulnerabilities, and Sparse Merkle Trees (SMTs).