i am a stochastic carrot
mistymntncop
- 128 Followers
- 255 Following
- 139 Posts
@pervognsen It's a cool trick. I hope this is correct. I don't bother with having the current version node point to the actual values array, it just makes things more complicated. Uses stackless traversal using pointer reversal for reroot, no recursion needed.
https://gist.github.com/mistymntncop/d2b54ef13911f5ef203f4160bfd06102
@pervognsen mmm, i think it's starting to make more sense now. With figures 1 and 2 of the version tree. And then they do pointer reversal from the current version to the target version to rollback to a particular version state.
@pervognsen Thanks. Don't know OCaml so it's a bit of a struggle for me. Trying to use Gemini to help me understand ha.
Not sure if this is correct but here is a partially persistent B+Tree with the V2 trick.
https://gist.github.com/mistymntncop/2cbcee30ac3cc47a287f1b64f6dd6bf5
https://gist.github.com/mistymntncop/2cbcee30ac3cc47a287f1b64f6dd6bf5
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
https://www.rfleury.com/p/multi-core-by-default
Worth reading!
Worth reading!
Writeup for the 3rd hole exploitation technique :-).
https://github.com/mistymntncop/CVE-2025-6554/blob/main/exploit.js
https://github.com/mistymntncop/CVE-2025-6554/blob/main/exploit.js
