Bbtree: Fastest Ordered Map

Okay I spent an hour trying to read this AI Slop. The prefix key idea is "cool" (see: 1). Gives you sort of "best of both words" B+ tree and B tree behavior.

It only applies to `u64`, `u128`, `[u8]`, `str` (and box/vec variants) AFAIT [2]. Their own 'agentic' pre-release checklist calls this out as work that needs to be done prior to release. But then I can be wrong because as OP says

> No human can write better code than LLMs. All of the implementation is written by LLMs, and cross-checked by LLMs from different providers.

cites:

1. https://bbtree.xiangpeng.systems/post/#apply-to-b-trees

2. https://github.com/XiangpengHao/bbtree/blob/main/bbtree/src/...

> No human can write better code than LLMs.

Bold claim...

> Production-ready by formal verification, model checking, deterministic simulation, fuzzing, and lots of testing.

What does model checking mean here?

Very nice work. I'm working on stuff... adjacent to this I guess. I've been harping on the ideas that we have to be much more willing to reach for intrinsics, be laser focused on the cache lines, treat DRAM more like an async block device, but I can't believe I haven't thought to show the impact of coherence traffic! When I get some time I might try to apply some of my tricks to bbtree. DM me. I'd love to be able to reach out when I do.

https://news.ycombinator.com/item?id=50218616

[dead]

looks awesome, thanks for sharing