Well, yes (for all practical senses of "disk storage"), but the more general point is that Grover's algorithm applies after other improvements (if not instead o

Well, yes (for all practical senses of "disk storage"), but the more general point is that Grover's algorithm applies after other improvements (if not instead of them, which is probably more common). If you have a way to reduce the complexity by a factor of 2^64, you get a classical (brute force) complexity of 2^192, which Grover's algorithm might be able to reduce to 2^96 quantum complexity, at best, assuming the classical optimization doesn't conflict with it. Realistically, the table thing doesn't work at all, so the problems with applying Grover's algorithm don't actually matter. (If you're just brute-forcing a int256_t for any value that makes your for-all predicate fail, Grover works fine to reduce the 2^256 classical operations to O(2^128)-ish quantum operations.)