2 ms·
Are you saying that two distinct pieces of content can never collide? That seems obviously incorrect. For example, take the integers 0 - 196,561, and put them
by jrmg 4mo ago
Are you saying that two distinct pieces of content can never collide? That seems obviously incorrect.
For example, take the integers 0 - 196,561, and put them into your lattice-based map. Something’s got to give. There are only 196,560 containers in the map (right?)
- Retr0id 4mo agoIt's just a regular hash table with linear probing https://github.com/yon-language/yon/blob/aa4617ced3abc92ac53afb4d49b258df52e84e24/runtime/xleech2_heap.c#L280-L285 https://github.com/yon-language/yon/blob/aa4617ced3abc92ac53... The only relation to the Leech group appears to be the number of slots. When a table gets full they allocate a second one, and so on, up until 256 tables when allocations start silently failing (after exactly 50319104 allocations).
- jrmg 4mo agoHa! Well that answers my question. I hope OP is seriously considering what’s actually been built here, and how their interactions with whatever LLM they’ve been using really reflects that. I’m genuinely a bit concerned for them.