Post #3722205
2026-07-10 17:45 UTC
@zwarich@hachyderm.io @joe@f.duriansoftware.com Maybe if you did everything Knuth-style with “pointers” being integers into one big continuously-allocated heap (or multiple heaps by kind, etc), you could guarantee determinism from run to run even if the behavior does depend on hashing order
Replies (2)
-
@Gankra@toot.cat 2026-07-10 18:07
@slava@mathstodon.xyz @zwarich@hachyderm.io @joe@f.duriansoftware.com common rust W making pointer-based graphs too hard to use so you have to use ids
-
@zwarich@hachyderm.io 2026-07-10 17:49
@slava@mathstodon.xyz @joe@f.duriansoftware.com Yeah, I was going to say that maybe this is just God encouraging you to use integer indices rather than pointers. You could also use data structures whose interface forbids you from iterating over the contents in a manner that exposes the underlying address ordering. However, I’m not aware of a type system that would fundamentally allow having pointers but prohibiting their bits from leaking.