mistymntncop

128 Followers
255 Following
139 Posts
i am a stochastic carrot
Not sure if this is correct but here is a partially persistent B+Tree with the V2 trick.
https://gist.github.com/mistymntncop/2cbcee30ac3cc47a287f1b64f6dd6bf5
persistent_btree_v2.c

GitHub Gist: instantly share code, notes, and snippets.

Gist
Who needs Graphviz when you can build it yourself?

Exploring a new layout algorithm for control flow graphs.

SpiderMonkey JavaScript/WebAssembly Engine

https://www.youtube.com/watch?v=gh2A7yFsBZ4

Allen's debut opening of his data structures series. Give it a watch.

Data Structures [1]: Arity Nodes

YouTube
Multi-Core By Default

On multi-core programming, not as a special-case technique, but as a new dimension in all code.

Digital Grove
Writeup for the 3rd hole exploitation technique :-).
https://github.com/mistymntncop/CVE-2025-6554/blob/main/exploit.js
CVE-2025-6554/exploit.js at main · mistymntncop/CVE-2025-6554

Contribute to mistymntncop/CVE-2025-6554 development by creating an account on GitHub.

GitHub
@pervognsen I think you said in the past how you dont use node pointers in yer B+Tree implementations anymore. This is just a pedagogical sketch so I used pointers. I'd be curious what other things you do differently with yer B+trees since yer old gist.

Partially persistent B+Tree based upon @pervognsen old B+Tree gist. Converted from recursive to iterative implementation. Uses a unified representation for both interior and leaf nodes for pedagogical simplicity. I really like the iterative version of insert/delete as its just one function for each operation that I can read from top to bottom. By using a Zipper for tree navigation and mutation it becomes easy to add (partial) persistence to tree data structures. That is to say, you use the go_up, go_down functions to navigate the tree and whenever you want to mutate the tree you always use the pointer returned by mutable_focus, also you have to add version numbers on node creation.

https://gist.github.com/mistymntncop/42c59bbcd38596003a85c6e94df00547

persistent_btree.c

GitHub Gist: instantly share code, notes, and snippets.

Gist
Everywhere at the End of Tau | The Laplacian of Dementia

YouTube
@pervognsen
What was that tweet you made once about extendible hashing? I think you posted a link to a codebase that used some extendible hashing trick? I've forgotten the details of your insight completely :'(. Is this ringing any bells :O ?