[Cryptography] LUKS on ATA versus on SSD

[Ron Garret]

> On Jan 3, 2026, at 2:19 AM, zeb--- via cryptography <cryptography at metzdowd.com> wrote:
> 
>> From: Ron Garret
>> Sent: Friday, 2 January 2026 03:06
>> 
>> Um, no.  Gödel numbering is a one-to-one mapping from strings of symbols to numbers.  Hashes are not a Gödel-numbering scheme because they are not one-to-one.
> 
> Well, there are perfect hashes, and jukeboxes (or even phonographs, even though they may break).

That's true, but the *definition* of a hash function is a function that maps data of arbitrary size to FIXED-SIZE VALUES, so a perfect hash must have a finite domain.  A Godel numbering scheme has to be able to handle an infinite number of strings.

rg