csa-scientist-open-letter.org/Sep2025
csa-scientist-open-letter.org/Sep2025
A clubcard is a membership test for an r element subset of an n element set. Size is ~1.13 log(n choose r) bits. Or (better!) ~1.13 Σ log(n_i choose r_i) where i indexes blocks of a partition.
A clubcard is a membership test for an r element subset of an n element set. Size is ~1.13 log(n choose r) bits. Or (better!) ~1.13 Σ log(n_i choose r_i) where i indexes blocks of a partition.
Authenticate with a paid account to obtain tokens, then anonymously redeem them to make unlinkable searches.
Kagi already respects your privacy when you search. With Privacy Pass, we’re taking it a step further by adding an extra layer of anonymity to ensure your searches are completely unlinkable to your account🔒
Learn more: blog.kagi.com/kagi-privacy...
Authenticate with a paid account to obtain tokens, then anonymously redeem them to make unlinkable searches.
2035 is ten years from now, there's no need to rush anything right now.
csrc.nist.gov/Projects/pqc... is still running and large ecosystems are still figuring out what/how to deploy.
2035 is ten years from now, there's no need to rush anything right now.
csrc.nist.gov/Projects/pqc... is still running and large ecosystems are still figuring out what/how to deploy.