Scalable Bloom Filters
(P. Almeida, C. Baquero, N. Preguiça, D. Hutchinson)
This month, we are learning more about this storage-efficient iteration of bloom filters which — as an example — could potentially be a viable improvement for verifying the legitimacy of ZKAPs. Our team’s conversation will explore its potential, and also consider the related trade-off of an increase in false positives.
Similar to a book club, our "Paper Club" is a periodic meeting where we discuss a paper as a team.