amenn

I am using flat memory comparisons (memcmp)

Still writing the docs. Content addressing is the mechanism, that is: same content lands in the same slot, equality is a handle compare. The allocator is provably extensional so distinct content never aliases even though the hash itself can collide. The Leech part: the heap is sized to the lattice's 196,560 minimal vectors, the coordinate-to-slot map is a collision-free perfect hash built from the Conway group's mm_op tables, and that fixed universe is what makes sets into 196,560-bit bitmaps with O(1) membership and bitwise ops.

There's no wrong in vibe coding as long as you check what's the output. I can be wrong or missing the goal of course. But the work is in progress and I'm not writing a bash script for the theorem of pytagora. It's more complex and I'm studying as I go. You reviewed frontend/ast.ml, the small kernel, and concluded MLTT, but you missed frontend/cubical.ml. Thanks for the time you took to bring this critique, it will be helpful in the end.

Hi everyone, and thanks for taking the time to read about Yon. I had an idea and I threw it down, and I'm refining it day by day. It's hard because I have little time, but I'm trying. Most of the concepts seem to be working, and that makes me proud of the intuition, even if it's eccentric enough to look psychotic. Better docs, cleaner and more coherent code, new benchmarks and use cases will come. But it's version 1.0: what did you expect? I'm alone in this exploration. A few answers for you trough the comments...