bytehamster

6 ms·

1. 1.▲
   by bytehamster 9mo ago

   If I understood their first demo correctly, they verified a fedora iso with a detached signature. The booted iso then printed "hello 39c3". https://streaming.media.ccc.de/39c3/relive/1854
2. 2.▲
   by bytehamster 1y ago

   There is no deserialization time or space overhead. The measurements refer to the deserialized form. They are not loaded from disk. About false positive checks, I think you misunderstand what a perfect hash function does.
3. 3.▲
   by bytehamster 1y ago

   That sounds super interesting! Do you remember the title or the authors of the paper?
4. 4.▲
   by bytehamster 1y ago

   In the appendix of the survey, there are 3 references on dynamic perfect hashing. I think the only actual implementation of a dynamic PHF is a variant of perfect hashing though fingerprinting in the paper "perfect hashing for network a
5. 5.▲
   by bytehamster 1y ago

   Addition: BBHash, in turn, is a re-implementation of FiPHa (perfect hashing through fingerprinting). There are quite many re-implementations of FiPHa: BBHash, Boomph, FiPS, FMPH, etc. As shown in the survey, BBHash is by far the slowest. Ev
6. 6.▲
   by bytehamster 1y ago

   Many modern perfect hash functions are super close to the space lower bound, often having just between 3% and 50% overhead. So your claim that the space consumption "twice as low" is information theoretically impossible. With gper