3 ms·
You shard the number into groups with a salt for each, until you reach a number of combinations that is computable for FB size on a check request, but way too l
by BiteCode_dev 4y ago
You shard the number into groups with a salt for each, until you reach a number of combinations that is computable for FB size on a check request, but way too long pre-generate. You can combine it with some bloom like filter to increase efficiency.
- compsciphd 4y agoCan you more explain that as an example. I understand the words, but doesn't extend to me seeing the design of it.