Post #3722210
2026-07-10 17:41 UTC
@slava@mathstodon.xyz @joe@f.duriansoftware.com There is actually a whole field of history-independent data structures, including a history-independent linearly probed hash table. Whenever data structures people invent things like this I assume they have bad characteristics in practice, though.
Replies (1)
-
@slava@mathstodon.xyz 2026-07-10 17:44
@zwarich@hachyderm.io @joe@f.duriansoftware.com Ideally in a compiler you wouldn’t have any hash functions that depend on the address of a value at all, because then it’s easy to introduce non-deterministic behavior. But I assume it’s not practical to ban this entirely