Recent content on blintz base
I made a small KV cache calculator for some current open-weight models, based on Neil Movva’s . KV Cache Calculator at 85% of GPU memory usable for weights + KV cache Memory: Average Sequence Length: Model Max Batch Size based on Neil Movva's KV cache calculator
Cryptography is not based on NP-complete problems - let me explain why. Hard problems in cryptography Cryptographic schemes are based on the computational difficulty of solving some ‘hard’ problem. For example, RSA (specifically, RSA-2048) is based on the difficulty of a problem like this: The RSA Problem I generate two large, random prime numbers, p p p and q q q , each of length 1024…
You can check whether a password has appeared in a previous data breach at haveibeenpwned.com/passwords . The only issue is, of course, that you have to enter your password to find out if it’s been in a breach. I built a tool that uses homomorphic encryption to perform these lookups completely privately. Here’s why I built it, and an explanation of how it works. When…
This is a from-scratch explanation of private information retrieval built using homomorphic encryption. I try to assume only a general math / computer science background. To simplify things, my explanations may not always match academic definitions. You can check out this paper or code for more. Table of Contents Constructing PIR using homomorphic encryption Lattice-based cryptography Learning…
Visual Studio Code is a pretty good at inferring the structure of C/C++ projects and automatically building accurate symbol tables and resolving references. Every once in a while, especially when I’m using VSCode remotely using SSH, the IntelliSense processes go haywire and all definitions become difficult to resolve. There is some intersection between upgrading the version of the C/C++…