Hashcash for proving set membership: Revision history

4 January 2025

• curprev 04:2304:23, 4 January 2025 Robertsdotpm talk contribs 3,943 bytes +22 →Introduction undo
• curprev 04:0404:04, 4 January 2025 Robertsdotpm talk contribs 3,921 bytes −11 →Author commentary undo
• curprev 04:0404:04, 4 January 2025 Robertsdotpm talk contribs 3,932 bytes +338 No edit summary undo Tag: Visual edit

3 January 2025

• curprev 05:1305:13, 3 January 2025 Robertsdotpm talk contribs 3,594 bytes +3,594 Created page with "Algorithms like merkle trees and bloom filters allow you to take a group of data items and construct a unique fingerprint of the set. The fingerprint can then be used as a way to prove that some or all members in the group are part of that “fingerprint.” These constructs are useful and you seem them used a lot in blockchains. The issue for me with these data structures is really the size of the meta data relative to the set size: Bloom filters suck because they only..."